Revisiting Wiener’s Attack – New Weak Keys in RSA

DOI10.1007/978-3-540-85886-7_16zbMath1181.94102OpenAlexW1865276762MaRDI QIDQ3540147

Subhamoy Maitra, Santanu Sarkar

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85886-7_16

zbMATH Keywords

RSAfactorizationcryptanalysisweak keys

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (5)

Attacking RSA Using an Arbitrary Parameter ⋮ Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Improving small private exponent attack on the Murru-Saettone cryptosystem ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices

Uses Software

• SageMath

Cites Work

• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Cryptanalysis of `less short' RSA secret exponents
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• Continued fractions and RSA with small secret exponent
• Cryptanalysis of short RSA secret exponents
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A p + 1 Method of Factoring
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Public Key Cryptography - PKC 2005
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Revisiting Wiener’s Attack – New Weak Keys in RSA