Public Key Cryptography – PKC 2004

DOI10.1007/b95631zbMath1198.94082OpenAlexW2482419090MaRDI QIDQ5901790

Johannes Blömer, Alexander May

Publication date: 14 May 2009

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

Full work available at URL: https://doi.org/10.1007/b95631

zbMATH Keywords

RSAcontinued fractionsweak keysWiener attack

Mathematics Subject Classification ID

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

Related Items (17)

An application of Euclidean algorithm in cryptanalysis of RSA ⋮ Attacking RSA Using an Arbitrary Parameter ⋮ Classical attacks on a variant of the RSA cryptosystem ⋮ New Attacks on RSA with Moduli N = p r q ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ A generalized attack on the multi-prime power RSA ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ Another Generalization of Wiener’s Attack on RSA ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ A generalized attack on some variants of the RSA cryptosystem ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ A new attack on RSA with two or three decryption exponents ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Cryptanalysis of RSA Using the Ratio of the Primes ⋮ A New Class of Weak Encryption Exponents in RSA ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem

This page was built for publication: Public Key Cryptography – PKC 2004