|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Quantum mechanical meet-in-the-middle search algorithm for Triple-DES显示文摘We present a quantum mechanical meet-in-the-middle search algorithm inosculating the quantum computing theory with crypt-analysis method and basing on the Grover’s algorithm and the meet-in-the-middle attack, which can solve the three-key triple-DES in O(56 256) steps and with O(256) memory cost. The computational complexity is apparently reduced, compared with that of the existing algorithms. | ZHONG PuCha BAO WanSu | 2010 | Chinese Science Bulletin2010，55，3： | 9 |
| 2 | A quantum algorithm for searching a target solution of fixed weight显示文摘To search for a target n-product Boolean vector of fixed weight d, we propose an important method involving the notion of a fixed-weight 'vector label' accompanied with a vector label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically O ((Cdn+1)^(1/2)) , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions. | WANG Xiang BAO WanSu FU XiangQun | 2011 | Chinese Science Bulletin2011，56，6： | 8 |
| 3 | Decoy-state quantum key distribution for the heralded pair coherent state photon source with intensity fluctuations显示文摘This paper characterizes two important properties of the photon number distribution of the heralded pair coherent state (HPCS) photon source. The formula of secret key generation rates for the decoy-state quantum key distribution with intensity fluctuation source is proved to hold true for the HPCS photon source. By numerical simulations, we show that the three-intensity decoy-state protocols for the HPCS photon source is efficiently getting close to the ideal decoy-state method. Moreover, we find that the HPCS source is more robust against intensity fluctuation than the weak coherent photon (WCP) source, but less stable than the heralded single photon source (HSPS). | ZHOU Chun, BAO WanSu & FU XiangQun Institute of Electronic Technology, The PLA Information Engineering University, Zhengzhou 450004, China | 2010 | Science China(Information Sciences)2010，53，12： | 7 |
| 4 | t-bit semiclassical quantum Fourier transform显示文摘Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,we define the t-bit semi- classical quantum Fourier transform.In terms of probability amplitude,we prove that the transform can realize quantum Fourier transformation,illustrate that the requirement for the two-qubit gate reduces obviously,and further design a quantum circuit of the transform.Combining the classical fixed-window method and the implementation of Shor's quantum factorization algorithm,we then redesign a circuit for Shor's algorithm,whose required computation resource is approximately equal to that of Parker's.The requirement for elementary quantum gates for Parker's algorithm is 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker's.However,our circuit is t2 times as fast as Parker's,where t is the width of the window. | FU XiangQun BAO WanSu ZHOU Chun SONG Zhen | 2012 | Chinese Science Bulletin2012，57，1： | 5 |
| 5 | A quantum algorithm for the dihedral hidden subgroup problem based on lattice basis reduction algorithm显示文摘To optimize the algorithms for the dihedral hidden subgroup problem,we present a new algorithm based on lattice basis reduction algorithm.For n\120,we reduce the dihedral hidden subgroup problem to shortest vector problem.A subroutine is given to get a transition quantum state by constructing a phase filter function,and then the measurement basis are derived based on the lattice basis reduction algorithm for solving low density subset sum problem.Finally,the parity of slope s is revealed by the measurement.This algorithm needs preparing mn quantum states,m qubits to store and O(n2)classical space,which is superior to existing algorithms. | Fada Li Wansu Bao Xiangqun Fu | 2014 | Chinese Science Bulletin2014，59，21： | 5 |
| 6 | Speeding up implementation for Shor's factorization quantum algorithm显示文摘In this paper, based on the implementation of semiclassical quantum Fourier transform, we first propose the concept of generation vector of ternary binary representation, construct the generation function's truth table, prove that the generation vector of ternary binary representation is one kind of k 's NAF representation and further find that its number of nonzero is not more than [(「logk」+1) /2]. Then we redesign a quantum circuit for Shor's algorithm, whose computation resource is approximately equal to that of Parker (Their requirements of elementary quantum gate are both O (「logN」3), and our circuit requires 2 qubits more than Parker's). However, our circuit is twice as fast as Parker's. | FU XiangQun BAO WanSu ZHOU Chun | 2010 | Chinese Science Bulletin2010，55，32： | 4 |
| 7 | Multiparty quantum secret sharing scheme based on the phase shift operations显示文摘 | Du Yutao Bao Wansu | 2013 | Opt Commun2013，308，： | 1 |
| 8 | A MULTICAST KEY MANAGEMENT SCHEME BASED ON CHARACTERISTIC VALUES OF MEMBERS显示文摘A new collusion attack on Pour-like schemes is proposed in this paper. Then, we present a collusion-free centralized multicast key management scheme based on characteristic values of members. The re-keying method that other group members calculate new keys when a member is joining or leaving is also designed. It achieves forward secrecy and backward secrecy. Compared with typical existing centralized schemes, the storage of Group Key Controller (GKC) in our scheme halves the storage overhead of others, and communication overhead of GKC is 2 in case of joining re-keying. Especially, the leaving re-keying overhead is and the overall performance is excellent. | Du Xiaoqiang Bao Wansu Fu Xiangqun | 2012 | Journal of Electronics(China)2012，29，3： | 1 |
| 9 | A RING SIGNATURE SCHEME OVER BRAID GROUPS显示文摘Quantum algorithms bring great challenges to classical public key cryptosystems, which makes cryptosystems based on non-commutative algebraic systems hop topic. The braid groups, which are non-commutative, have attracted much attention as a new platform for constructing quantum attack-resistant cryptosystems. A ring signature scheme is proposed based on the difficulty of the root extraction problem over braid groups, which can resist existential forgery against the adaptively cho-sen-message attack under the random oracle model. | Wei Yun Xiong Guohua Bao Wansu Zhang Xingkai | 2010 | Journal of Electronics(China)2010，27，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员