Forty years of attacks on the RSA cryptosystem: A brief survey
Authors:
- 2 January 2019
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 22 (1) , 9-29
Abstract
RSA public key cryptosystem is the de-facto standard use in worldwide technologies as a strong encryption/decryption and digital signature scheme. RSA successfully defended forty years of attack since invention. In this study we survey, its past, present advancements and upcoming challenges that needs concrete analysis and as a counter measure against possible threats according to underlying algebraic structure. Past studies shows us some attacks on RSA by inspecting flaws on relax model using weak public/private keys, integer factorization problem, and some specific low parameter selection attacks. Such flaws can not hamper the security of RSA cryptosystem by at large, but can explore possible vulnerabilities for more deep understanding about underlying mathematics and improper parameter selection. We describe a brief survey of past findings and detail description about specific attacks. A comprehensive survey of known attacks on RSA cryptosystem shows us that a well implemented algorithm is unbreakable and it survived against a number of cryptanalytic attacks since last forty years.Keywords
This publication has 40 references indexed in Scilit:
- RSA based remote password authentication using smart cardJournal of Discrete Mathematical Sciences and Cryptography, 2012
- Systematic literature reviews in software engineering – A tertiary studyInformation and Software Technology, 2010
- Cryptanalysis of RSA for a special case with d >eScience China Information Sciences, 2008
- Algorithm for factoring some RSA and Rabin moduliJournal of Discrete Mathematical Sciences and Cryptography, 2008
- Finding small roots of univariate modular equations revisited1997
- Cryptanalysis of short RSA secret exponentsIEEE Transactions on Information Theory, 1990
- Solving Simultaneous Modular Equations of Low DegreeSIAM Journal on Computing, 1988
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978