Searcharxiv⌕ Search

arXiv subjects

An-Ping Li

Publications and source records attributed to An-Ping Li.

53 records · Page 3Linked to original sources

Design of Atomically Precise Nanoscale Negative Differential Resistance Devices

Down-scaling device dimensions to the nanometer range raises significant challenges to traditional device design, due to potential current leakage across nanoscale dimensions and the need to maintain reproducibility while dealing with atomic-scale components. Here we investigate negative differential resistance (NDR) devices based on atomically precise graphene nanoribbons. Our computational evaluation of the traditional double-barrier resonant tunneling diode NDR structure uncovers important issues at the atomic scale, concerning the need to minimize the tunneling current between the leads while achieving high peak current. We propose a new device structure consisting of multiple short segments that enables high current by the alignment of electronic levels across the segments while enlarging the tunneling distance between the leads. The proposed structure can be built with atomic precision using a scanning tunneling microscope (STM) tip during an intermediate stage in the synthesis of an armchair nanoribbon. An experimental evaluation of the band alignment at the interfaces and an STM image of the fabricated active part of the device are also presented. This combined theoretical-experimental approach opens a new avenue for the design of nanoscale devices with atomic precision.

cond-mat.mes-hall↗

A note on Waring's problem

In this paper, we will present a new iterative construction for the auxiliary equation of Waring's problem, which seems a little simpler than the one of so called "smooth numbers" in papers [4] and [8], and give same upper bounds of G(k) as in [4], [8].

math.NT↗

On h-basis

A set A of positive integers is called a h-bais of [0,n] if each integer in [0,n]is a sum of no more than h members of A. In this paper, we will give a new construction for h-basis.

math.CO↗

A note on B_k sequences

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

math.CO↗

Friedel Oscillation-Induced Energy Gap Manifested as Transport Asymmetry at Monolayer-Bilayer Graphene Boundaries

We show that Friedel charge oscillation near an interface opens a gap at the Fermi energy for electrons with wave vectors perpendicular to the interface. If the Friedel gaps on two sides of the interface are different, a nonequlibrium effect - shifting of these gaps under bias - leads to asymmetric transport upon reversing the bias polarity. The predicted transport asymmetry is revealed by scanning tunneling potentiometry at monolayer-bilayer interfaces in epitaxial graphene on SiC (0001). This intriguing interfacial transport behavior opens a new avenue towards novel quantum functions such as quantum switching.

cond-mat.mes-hall↗

A note on Turan number T(k+1,k,n)

Turán number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Turán number.

math.CO↗

A remark on B_3 sequences

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.

math.CO↗

Recover plaintext attack to block ciphers

we will present an estimation for the upper-bound of the amount of 16-bytes plaintexts for English texts, which indicates that the block ciphers with block length no more than 16-bytes will be subject to recover plaintext attacks in the occasions of plaintext -known or plaintext-chosen attacks.

cs.CR↗

A New Type of Cipher: DICING_csb

In this paper, we will propose a new type of cipher named DICING_csb, which is derived from our previous stream cipher DICING. It has applied a stream of subkey and an encryption form of block ciphers, so it may be viewed as a combinative of stream cipher and block cipher. Hence, the new type of cipher has fast rate like a stream cipher and need no MAC.

cs.CR↗

A New Stream Cipher: Dicing

In this paper, we will propose a new synchronous stream cipher named DICING, which can be viewed as a clock-controlled one but with a new mechanism of altering steps. It has satisfactory performance and there have not been found weakness for the known attacks, the key sizes can be 128bits and 256bits respectively.

cs.CR↗

A new key exchange cryptosystem

In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.

cs.CR↗

Birthday attack to discrete logarithm

The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.

cs.CR↗

A generic attack to ciphers

In this paper, we present a generic attack for ciphers, which is in essence a collision attack on the secret keys of ciphers .

cs.CR↗