Attacking RSA using an arbitrary parameter

DOI10.1007/978-3-030-51938-4_19MaRDI QIDQ5048985zbMATH OpenOpenAlexFDO

Authors Muhammad Rezal Kamel Ariffin, Amir Hamzah Ghafar Ghafar Abd, Muhammad Asyraf Asbullah

Publication date 9 November 2022

Published in Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-51938-4_19

zbMATH Keywords

Coppersmith's methodcryptanalysisDiophantine approximationRSA cryptosystem

Mathematics Subject Classification ID

Diophantine approximation, transcendental number theory (11J99) Cryptography (94A60)

Recommendations

• New Attacks on the RSA Cryptosystem
• Successful cryptanalytic attacks upon RSA moduli N=pq
• Cryptanalysis of RSA with a small parameter
• A generalized attack on some variants of the RSA cryptosystem
• New approach for efficiently computing factors of the RSA modulus

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A new vulnerable class of exponents in RSA
• Cryptanalysis of RSA Using the Ratio of the Primes
• Cryptanalysis of short RSA secret exponents
• Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
• Factoring integers with elliptic curves
• Finding a small root of a bivariate integer equation; factoring with high bits known
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• New Attacks on the RSA Cryptosystem
• New weak RSA keys
• Public Key Cryptography – PKC 2004
• Revisiting Wiener’s Attack – New Weak Keys in RSA
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Cited in

(2)

• Side-Channel Attack against RSA Key Generation Algorithms
• Perturbating RSA Public Keys: An Improved Attack

This page was built for publication: Attacking RSA using an arbitrary parameter

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