arXiv subjects
Publications and source records attributed to Hao Chen.
We present here another proof of Oscar Rojo's theorems about the spectrum of graph Laplacian on certain balanced trees, by taking advantage of the symmetry properties of the trees in question, and looking into the eigenfunctions of Laplacian.
Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction (\cite{Blom84,BSHKY92,S97}). Recently the hierarchical cryptography and the key management for hierarchical networks have been active topics(see \cite{BBG05,GHKRRW08,GS02,HNZI02,HL02,Matt04}. ). Key agreement schemes for hierarchical networks were presented in \cite{Matt04,GHKRRW08} which is based on the Blom key predistribution scheme(Blom KPS, [1]) and pairing. In this paper we introduce generalized Blom-Blundo et al key predistribution schemes. These generalized Blom-Blundo et al key predistribution schemes have the same security functionality as the Blom-Blundo et al KPS. However different and random these KPSs can be used for various parts of the networks for enhancing the resilience. We also presentkey predistribution schemes from a family hyperelliptic curves. These key predistribution schemes from different random curves can be used for various parts of hierarchical networks. Then the non-interactive, identity-based and dynamic key predistributon scheme based on this generalized Blom-Blundo et al KPSs and hyperelliptic curve KPSs for hierarchical networks with the following properties are constructed. 1)$O(A_KU)$ storage at each node in the network where $U$ is the expansion number and $A_K$ is the number of nodes at the $K$-th level of the hierarchical network; 2)Strongly resilience to the compromising of arbitrary many leaf and internal nodes; 3)Information theoretical security without random oracle.
BCH (Bose-Chaudhuri-Hocquenghen) error correcting codes ([1]-[2]) are now widely used in communication systems and digital technology. Direct LFSR(linear feedback shifted register)-based encoding of a long BCH code suffers from serial-in and serial-out limitation and large fanout effect of some XOR gates. This makes the LFSR-based encoders of long BCH codes cannot keep up with the data transmission speed in some applications. Several parallel long parallel encoders for long cyclic codes have been proposed in [3]-[8]. The technique for eliminating the large fanout effect by J-unfolding method and some algebraic manipulation was presented in [7] and [8] . In this paper we propose a CRT(Chinese Remainder Theorem)-based parallel architecture for long BCH encoding. Our novel technique can be used to eliminate the fanout bottleneck. The only restriction on the speed of long BCH encoding of our CRT-based architecture is $log_2N$, where $N$ is the length of the BCH code.
Propagation criterion of degree $l$ and order $k$ ($PC(l)$ of order $k$) and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1, 2, 3,6, 7,8,10,11,16]. Kurosawa, Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying $PC(l)$ of order $k$ from binary linear or nonlinear codes in. In this paper, algebraic-geometric codes over $GF(2^m)$ are used to modify Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying $PC(l)$ of order $k$. The new construction is compared with previously known results.
The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period $un$ sequence over $GF(p^m)$ to the computation of the linear complexities and minimal connection polynomials of $u$ period $n$ sequences. The conditions $u|p^m-1$ and $\gcd(n,p^m-1)=1$ are required for the result to hold. Some applications of this reduction in fast algorithms to determine the linear complexities and minimal connection polynomials of sequences over $GF(p^m)$ are presented.
For a secret sharing scheme, two parameters $d_{min}$ and $d_{cheat}$ are defined in [12] and [13]. These two parameters measure the error-correcting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [12,[9] and [13]. The MDS secret-sharing scheme was defined in [12] and it is proved that MDS perfect secret sharing scheme can be constructed for any monotone access structure. The famous Shamir $(k,n)$ threshold secret sharing scheme is the MDS with $d_{min}=d_{cheat}=n-k+1$. In [3] we proposed the linear secret sharing scheme from algebraic-geometric codes. In this paper the linear secret sharing scheme from AG-codes on elliptic curves is studied and it is shown that many of them are MDS linear secret sharing scheme.
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symmetric Boolean functions and rotation symmetric Boolean functions. Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value $\lceil \frac{n}{2}\rceil$ are constructed.
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa code) has been well-developed since the work of V.Goppa and Tsfasman, Vladut, and Zink(see [17], [18] and [19]). In this paper the linear secret-sharing scheme from algebraic-geometric codes, which are non-threshold scheme for curves of genus greater than 0, are presented . We analysis the minimal access structure, $d_{min}$ and $d_{cheat}$([8]), (strongly) multiplicativity and the applications in verifiable secret-sharing (VSS) scheme and secure multi-party computation (MPC) of this construction([3] and [10-11]). Our construction also offers many examples of the self-dually $GF(q)$-representable matroids and many examples of new ideal linear secret-sharing schemes addressing to the problem of the characterization of the access structures for ideal secret-sharing schemes([3] and [9]). The access structures of the linear secret-sharing schemes from the codes on elliptic curves are given explicitly. From the work in this paper we can see that the algebraic-geometric structure of the underlying algebraic curves is an important resource for secret-sharing, matroid theory, verifiable secret-sharing and secure multi-party computation.
We investigate Andreev reflection (AR) resonant tunneling through a precessing spin which is coupled to a normal metallic lead and a superconducting lead. The formula of the AR conductance at zero temperature is obtained as a function of chemical potential and azimuthal angle of the spin precessing by using the nonequilibrium Green function method. It is found that as the local spin precesses in a weak external magnetic field at Larmor frequency $ω_l$, the AR tunneling conductance exhibits an oscillation at the frequency $2ω_l$ alone. The amplitude of AR conductance oscillation enhances with spin-flip tunneling coupling increasing. The study also shows that spin-orbit interaction in tunneling barriers is crucial for the oscillations of AR conductance. The effect of spin-flip tunneling coupling caused by spin-orbit interaction and local spin precessing on resonant behavior of the AR conductance are examined.
We study Andreev reflection (AR) tunneling through a quantum dot (QD) connected to a ferromagnet and a superconductor, in which the intradot spin-flip interaction is included. By using the nonequibrium-Green-function method, the formula of the linear AR conductance is derived at zero temperature. It is found that competition between the intradot spin-flip scattering and the tunneling coupling to the leads dominantes resonant behaviours of the AR conductance versus the gate voltage.A weak spin-flip scattering leads to a single peak resonance.However, with the spin-flip scattering strength increasing, the AR conductance will develop into a double peak resonannce implying a novel structure in the tunneling spectrum of the AR conductance. Besides, the effect of the spin-dependent tunneling couplings, the matching of Fermi velocity, and the spin polarization of the ferromagnet on the AR conductance is eximined in detail.
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication and quantum cryptography ([16],[17],[6]). In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states in bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. In this way algebraic geometry and complex differential geometry of these algebraic sets turn to be powerful tools for the understanding of quantum enatanglement. Our construction has applications in the following important topics in quantum information theory: 1) separability criterion, it is proved the algebraic sets have to be the sum of the linear subspaces if the mixed states are separable; 2) lower bound of Schmidt numbers, that is, generic low rank bipartite mixed states are entangled in many degrees of freedom; 3) simulation of Hamiltonians, it is proved the simulation of semi-positive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; 4) construction of bound enatanglement, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion. On the other hand many examples of entangled mixed states with rich algebraic-geometric structure in their associated determinantal varieties are constructed and studied from this point of view.
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate that the problem of efficient simulation of Hamiltonians for arbitrary and multipartite quantum systems cannot be described by using only eigenvalues, unlike that in the two-qubit case.
We prove a lower bound for Schmidt numbers of bipartite mixed states. This lower bound can be applied easily to low rank bipartite mixed states. From this lower bound it is known that generic low rank bipartite mixed states have relatively high Schmidt numbers and thus entangled. We can compute Schmidt numbers exactly for some mixed states by this lower bound as shown in Examples. This lower bound can also be used effectively to determine that some mixed states cannot be convertible to other mixed states by local operations and classical communication. The results in this paper are proved by ONLY using linear algebra, thus the results and proof are easy to understand.
We give necessary conditions for the mixing problem in bipartite case, which are independent of eigenvalues and based on algebraic-geometric invariants of the bipartite states. One implication of our results is that for some special bipartite mixed states, only special mixed states in a measure zero set can be used to mix to get them. The results indicate for many physical problems on composite quantum systems the description based on majorization of eigenvalues is not sufficient
We first propose a new separability criterion based on algebraic-geometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r <m+n-2, generic rank r mixed states in mxn systems have relatively high Schmidt numbers (thus entangled) by this separability criterion. This also means that the algebraic-geometric separability criterion proposed here can be used to dectect all low rank entangled mixed states outside a measure zero set.
From the consideration of measuring bipartite mixed states by separable pure states, we introduce algebraic sets in complex projective spaces for bipartite mixed states as the degenerating locus of the measurement. These algebraic sets are independent of the eigenvalues and only measure the "position" of eigenvectors of bipartite mixed states. They are nonlocal invariants ie., remaining invariant after local unitary transformations. The algebraic sets have to be the sum of the linear subspaces if the mixed states are separable, and thus we give a "eigenvalue-free" criterion of separability.Based on our criterion, examples are given to illustrate that entangled mixed states which are invariant under partial transposition or fufill entropy and disorder criterion of separability can be constructed systematically.We reveal that a large part of quantum entanglement is independent of eigenvalue spectra and develop a method to measure this part of quantum enatnglement.The results are extended to multipartite case.
We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie. remaining invariant after local untary transformations). These invariants are naturally arised from the physical consideration of checking multipartite mixed states by measuring them with multipartite separable pure states. The algebraic sets have to be the sum of linear subspaces if the multipartite mixed state is separable, and thus we give a new separability criterion of multipartite mixed states. A continuous family of 4-party mixed states, whose members are separable for any 2:2 cut and entangled for any 1:3 cut (thus bound entanglement if 4 parties are isolated), is constructed and studied from our invariants and separability criterion. Examples of LOCC-incomparable entangled tripartite pure states are given to show it is hopeless to characterize the entanglement properties of tripartite pure states by only using the eigenvalue speactra of their partial traces. We also prove that at least $n^2+n-1$ terms of separable pure states, which are "orthogonal" in some sence, are needed to write a generic pure state in $H_A^{n^2} \otimes H_B^{n^2} \otimes H_C^{n^2}$ as a linear combination of them.
We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the algebraic-geometric separability criterion can be used to detect all low rank entangled mixed states outside a measure zero set.