RSA: a number of formulas to improve the search for \(p+q\)

DOI10.1515/JMC-2016-0046zbMath1376.94041OpenAlexW2766106624MaRDI QIDQ1684046

Ahmed Mohammed, Abdulrahman Alkhelaifi

Publication date: 4 December 2017

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0046

zbMATH Keywords

RSAcryptosystempublic key

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• Breaking RSA may be as difficult as factoring
• Factoring integers with elliptic curves
• Cryptanalysis of RSA with small prime difference
• Discrete logarithms: The past and the future
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA may not be equivalent to factoring
• Breaking RSA Generically Is Equivalent to Factoring
• Unnamed Item
• Unnamed Item

This page was built for publication: RSA: a number of formulas to improve the search for \(p+q\)