Cryptanalysis of `less short' RSA secret exponents
From MaRDI portal
Publication:1360997
DOI10.1007/s002000050082zbMath0882.94026OpenAlexW2119873454MaRDI QIDQ1360997
Eric R. Verheul, Henk C. A. van Tilborg
Publication date: 10 March 1998
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000050082
Related Items (19)
An application of Euclidean algorithm in cryptanalysis of RSA ⋮ On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA ⋮ A variant of Wiener's attack on RSA ⋮ Fast rebalanced RSA signature scheme with typical prime generation ⋮ The better bound of private key in RSA with unbalanced primes ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ Cryptanalysis of short secret exponents modulo RSA primes. ⋮ Large decryption exponents in RSA ⋮ Application of ECM to a class of RSA keys ⋮ On the number of sparse RSA exponents ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Об обобщении метода Дюжелла ⋮ CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS ⋮ Fixed points of the RSA encryption algorithm ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits ⋮ Cryptanalysis of large RSA exponent by using the LLL algorithm ⋮ Unnamed Item ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
This page was built for publication: Cryptanalysis of `less short' RSA secret exponents
