A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA

DOI10.1155/2010/421348zbMath1191.94102OpenAlexW2022296988WikidataQ58653082 ScholiaQ58653082MaRDI QIDQ966349

Hai-feng Zhang, Ming-Qiang Wang

Publication date: 23 April 2010

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227077

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA