Low-Exponent RSA with Related Messages

DOI10.1007/3-540-68339-9_1zbMath1301.94111OpenAlexW2168581558MaRDI QIDQ2876882

Don Coppersmith, Jacques Patarin, Michael K. Reiter, Matthew Franklin

Publication date: 20 August 2014

Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68339-9_1

zbMATH Keywords

attacks against RSA with low encrypting exponent

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics ⋮ Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC) ⋮ Large decryption exponents in RSA ⋮ All-or-nothing encryption and the package transform ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ Equal To The Task? ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

This page was built for publication: Low-Exponent RSA with Related Messages