Public Key Cryptography - PKC 2006

DOI10.1007/11745853MaRDI QIDQ5898932zbMATH OpenOpenAlexFDO

Authors Daniel Bleichenbacher, Alexander May

Publication date 2 May 2007

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

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

zbMATH Keywords

Coppersmith's methodlatticesRSAsmall exponents

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Small CRT-Exponent RSA Revisited
• A New Attack on RSA and CRT-RSA
• Small CRT-exponent RSA revisited
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• scientific article; zbMATH DE number 1942424

Cited in

(30)

• Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
• Small CRT-exponent RSA revisited
• Fast rebalanced RSA signature scheme with typical prime generation
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
• Generalized cryptanalysis of small CRT-exponent RSA
• Cryptanalysis of RSA with a small parameter revisited
• A new attack on RSA with two or three decryption exponents
• scientific article; zbMATH DE number 1583766 (Why is no real title available?)
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• A New Attack on RSA and CRT-RSA
• Cryptanalysis of RSA with a small parameter
• General bounds for small inverse problems and its applications to multi-prime RSA
• Partial key exposure attack on CRT-RSA
• New Attacks on RSA with Moduli N = p r q
• A small secret exponent attack on cryptosystems using Dickson polynomials
• Attacking RSA with a composed decryption exponent using unravelled linearization
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• Small secret exponent attack on RSA variant with modulus N=p^rq
• scientific article; zbMATH DE number 1942424 (Why is no real title available?)
• Attacks on the Search RLWE Problem with Small Errors
• Attacking Exponent Blinding in RSA without CRT
• Cryptanalysis of RSA with multiple small secret exponents
• Using LLL-reduction for solving RSA and factorization problems
• Efficient CRT-RSA decryption for small encryption exponents
• Small CRT-Exponent RSA Revisited
• Topics in Cryptology – CT-RSA 2006
• Practical attacks on small private exponent RSA: new records and new insights
• Partial key exposure attack on short secret exponent CRT-RSA
• Solving multivariate Coppersmith problems with known moduli

Describes a project that uses

Uses Software

• NTL

This page was built for publication: Public Key Cryptography - PKC 2006

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898932)