An application of Euclidean algorithm in cryptanalysis of RSA

DOI10.4171/EM/411zbMath1458.94275WikidataQ114021513 ScholiaQ114021513MaRDI QIDQ827545

Dimitrios Poulakis

Publication date: 13 January 2021

Published in: Elemente der Mathematik (Search for Journal in Brave)

zbMATH Keywords

RSA cryptosystemextended Euclid algorithmWiener attac

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Cryptanalysis of `less short' RSA secret exponents
• Large decryption exponents in RSA
• Cryptanalysis of RSA with small prime difference
• A variant of Wiener's attack on RSA
• Continued fractions and RSA with small secret exponent
• Another Generalization of Wiener’s Attack on RSA
• Application of ECM to a class of RSA keys
• Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Public Key Cryptography – PKC 2004

This page was built for publication: An application of Euclidean algorithm in cryptanalysis of RSA