supported by the National Natural Science Foundation of China(No.61303212,No.61170080,No.61202386);the State Key Program of National Natural Science of China(No.61332019,No.U1135004);the Major Research Plan of the National Natural Science Foundation of China(No.91018008);the National Basic Research Program of China(973 Program)(No.2014CB340600);the Hubei Natural Science Foundation of China(No.2011CDB453,No.2014CFB440)
Advances in quantum computation threaten to break public key cryptosystems such as RSA,ECC, and El Gamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now, no quantum...
supported by the National Natural Science Foundation of China(No.61303212,No.61170080,No.61202386);the State Key Program of National Natural Science of China(No.61332019,No.U1135004);the Major Research Plan of the National Natural Science Foundation of China(No.91018008);Major State Basic Research Development Program of China(973 Program)(No.2014CB340600);the Hubei Natural Science Foundation of China(No.2011CDB453,No.2014CFB440)
A key exchange protocol is considered unsafe.The scheme is based on a set of m commuting square singular matrices of dimension n×n over a finite field,and its security is claimed to rely on the hardness of the matrix...
Supported by the National Natural Science Foundation of China(61472429,61070192,91018008,61303074,61170240);the National High Technology Research Development Program of China(863 Program)(2007AA01Z414);the National Science and Technology Major Project of China(2012ZX01039-004);the Beijing Natural Science Foundation(4122041)
Small or smooth cloned regions are difficult to be detected in image copy-move forgery (CMF) detection. Aiming at this problem, an effective method based on image segmentation and swarm intelligent (SI) algorithm ...
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 ciph...
supported in part by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386);the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004);the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008);Major State Basic Research Development Program of China(973 Program)(No.2014CB340600);the Hubei Natural Science Foundation of China(Grant Nos.2011CDB453,2014CFB440)
Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certai...
Supported by the National Natural Science Foundation of China(61303212,61170080,61202386);the State Key Program of National Natural Science of China(61332019,U1135004);the Major Research Plan of the National Natural Science Foundation of China(91018008);Major State Basic Research Development Program of China(973 Program)(2014CB340600);the Natural Science Foundation of Hubei Province(2011CDB453,2014CFB440)
Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found ...
supported by the National Natural Science Foundation of China (Nos.61303212,61170080,61202386,61332019,U1135004,and 91018008);the National Key Basic Research and Development (973) Program of China (No.2014CB340600);the Natural Science Foundation of Hubei Province (Nos.2011CDB453 and 2014CFB440)
Advances in quantum computers threaten to break public-key cryptosystems (e.g., RSA, ECC, and EIGamal), based on the hardness of factoring or taking a discrete logarithm. However, no quantum algorithms have yet been...