Attacking RSA using an arbitrary parameter

DOI10.1007/978-3-030-51938-4_19zbMATH Open1504.94155OpenAlexW3039358126MaRDI QIDQ5048985FDOQ5048985

Amir Hamzah Ghafar Ghafar Abd, Muhammad Rezal Kamel Ariffin, 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

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

zbMATH Keywords

Diophantine approximationcryptanalysisCoppersmith's methodRSA cryptosystem

Mathematics Subject Classification ID

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

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Factoring integers with elliptic curves
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Public Key Cryptography – PKC 2004
• Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Title not available (Why is that?)
• Revisiting Wiener’s Attack – New Weak Keys in RSA
• New Attacks on the RSA Cryptosystem
• Cryptanalysis of RSA Using the Ratio of the Primes
• Title not available (Why is that?)

Cited In (2)

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

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)