The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions o...The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions or assumptions.First,we give two preconditions of applying Grover’s algorithm,which ensure that the success probability of finding the marked element is close to 1.Then,based on these two preconditions,it is found out that the success probability of the quantum algorithm for FXconstruction is far less than 1.Furthermore,we give the design method of the Oracle function,and then present the general method of combining Grover and Simon algorithm for attacking block ciphers,with success probability close to 1.展开更多
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...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.展开更多
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 attrac...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.展开更多
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,w...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.展开更多
基金supported by National Natural Science Foundation of China(Grant No.61502526)。
文摘The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions or assumptions.First,we give two preconditions of applying Grover’s algorithm,which ensure that the success probability of finding the marked element is close to 1.Then,based on these two preconditions,it is found out that the success probability of the quantum algorithm for FXconstruction is far less than 1.Furthermore,we give the design method of the Oracle function,and then present the general method of combining Grover and Simon algorithm for attacking block ciphers,with success probability close to 1.
文摘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.
基金Supported by the National Natural Science Foundation of China (No. 10501053)
文摘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.
文摘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.
