Back to Search Start Over

Analysis of RSA and Shor's algorithm for cryptography: A quantum perspective.

Authors :
Kute, Seema
Desai, Chitra
Jadhav, Mukti
Source :
AIP Conference Proceedings. 2024, Vol. 3156 Issue 1, p1-9. 9p.
Publication Year :
2024

Abstract

The complexity of public key algorithms like RSA and variants of Elgamal is based on the involvement of exponentiation in encryption and decryption. RSA is based on integer factorization and variants of Elgamal or based on discrete logarithms and are formed as hard problems. To achieve the perceived level of security, the required key length for public key cryptosystem needs to be determined. Quantum computers are capable of conducting an exponential number of simultaneous computations because of which they can find factors in polynomial time. Shor's algorithm is popular algorithm for factoring huge integers in polynomial time on quantum computers. This paper presents RSA algorithm followed by various possible attacks for factoring and demonstrates Shor's algorithm for factoring and discuss results for interpretations. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
0094243X
Volume :
3156
Issue :
1
Database :
Academic Search Index
Journal :
AIP Conference Proceedings
Publication Type :
Conference
Accession number :
180220953
Full Text :
https://doi.org/10.1063/5.0227773