Comparative analysis of integer factorization algorithms by G. Kimsanova, R. Ismailova, R. Sultanov

Subjects: “…integer factorization…”
Get full text

Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations by Aleksėjus Michalkovič, Jokūbas Žitkevičius

Subjects: Get full text

Scheme of extending elliptic curve method to three phases by Guiwen LUO

Subjects: “…integer factorization…”
Get full text

Further research on public-key cryptosystems based on third-order recurrence sequence by JIANG Zheng-tao 1, SUN Xi 1, TIAN Lei 2, WANG Yu-min 1

Subjects: Get full text

Factorization of big integer and the security of RSA by Yan-bing REN

“…Three kinds of methods for integer factorization were proposed and the security of RSA was demarcated.RSA is a well-known cryptographic algorithm,using the analysis result of those methods.Through the work,readers could easily realize that if merely enlarged two prime numbers but lost attention of the relevance of them,the security of this algorithm might been missed.In the end,two recommended tactics to choose prime numbers as key of this algorithm were given.…”
Get full text

Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives by Yevhen Kotukh, Hennadii Khalimov

“…Two hard problems have been widely used in public-key cryptography: integer factorization and the discrete logarithm problem. …”
Get full text

Proxy re-signature scheme based on isomorphisms of polynomial by Hui-xian LI, Lu SHAO, Liao-jun PANG

“…Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.…”
Get full text