Public Key Cryptography – PKC 2004

DOI10.1007/b95631zbMath1198.94113OpenAlexW2482419090MaRDI QIDQ5901804

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

Coppersmith's methodPartial Key Exposure Attacks

Mathematics Subject Classification ID

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

Related Items (16)

Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Cryptanalysis of Prime Power RSA with two private exponents ⋮ Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ New Attacks on RSA with Moduli N = p r q ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Small secret exponent attack on RSA variant with modulus \(N=p^rq\) ⋮ A generalized attack on the multi-prime power RSA ⋮ Cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Improved cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ A method for obtaining digital signatures and public-key cryptosystems ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ New number-theoretic cryptographic primitives ⋮ Revisiting prime power RSA

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