A parallel architecture for efficient hardware implementation of Rivest Shamir Adleman(RSA) cryptography is proposed.Residue number system(RNS) is introduced to realize high parallelism,thus all the elements under the...A parallel architecture for efficient hardware implementation of Rivest Shamir Adleman(RSA) cryptography is proposed.Residue number system(RNS) is introduced to realize high parallelism,thus all the elements under the same base are independent of each other and can be computed in parallel.Moreover,a simple and fast base transformation is used to achieve RNS Montgomery modular multiplication algorithm,which facilitates hardware implementation.Based on transport triggered architecture(TTA),the proposed architecture is designed to evaluate the performance and feasibility of the algorithm.With these optimizations,a decryption rate of 106 kbps can be achieved for 1 024-b RSA at the frequency of 100 MHz.展开更多
Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciph...Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C.The new algorithm has the following properties：1）recovering the RSA plaintext M from the ciphertext C without factoring n; 2）avoiding the even order of the element; 3）having higher success probability than Shor＇s; 4）having the same complexity as Shor＇s.展开更多
基金Supported by the Natural Science Foundation of Tianjin (No. 11JCZDJC15800)the National Natural Science Foundation of China(No. 61003306)
文摘A parallel architecture for efficient hardware implementation of Rivest Shamir Adleman(RSA) cryptography is proposed.Residue number system(RNS) is introduced to realize high parallelism,thus all the elements under the same base are independent of each other and can be computed in parallel.Moreover,a simple and fast base transformation is used to achieve RNS Montgomery modular multiplication algorithm,which facilitates hardware implementation.Based on transport triggered architecture(TTA),the proposed architecture is designed to evaluate the performance and feasibility of the algorithm.With these optimizations,a decryption rate of 106 kbps can be achieved for 1 024-b RSA at the frequency of 100 MHz.
基金Supported by the National Natural Science Foundation of China(61303212,61202386)the State Key Program of National Natural Science of China(61332019)the Major Research Plan of the National Natural Science Foundation of China(91018008,SKLSE-2015-A-02)
文摘Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C.The new algorithm has the following properties：1）recovering the RSA plaintext M from the ciphertext C without factoring n; 2）avoiding the even order of the element; 3）having higher success probability than Shor＇s; 4）having the same complexity as Shor＇s.
