Leveraging the power of quantum computing for breaking RSA encryption

  title={Leveraging the power of quantum computing for breaking RSA encryption},
  author={Moolchand Sharma and Vikas Choudhary and Ronak Bhatia and Sahil Malik and Anshuman Raina and Harshit Khandelwal},
  journal={Cyber-Physical Systems},
  pages={73 - 92}
ABSTRACT Encryption is the process of securing confidential data that bars a third party’s access to the information.RSA encryption utilises the property of complexity classes wherein the problem of prime integer factorization lies inside the Non-Polynomial time (NP-Hard) class, which makes it impervious to classical computers. Since it is so hard to break even for a computer, it becomes important to do encryption for all the secure transactions. Although it lies outside the capabilities of… 


Introduction to post-quantum cryptography
Imagine that it’s fifteen years from now and someone announces the successful construction of a large quantum computer. The New York Times runs a frontpage article reporting that all of the
Quantum cryptography in real-life applications: assumptions and security
  • Yi Zhao
  • Computer Science, Mathematics
  • 2009
This thesis addresses a number of discrepancies in the security proof of decoy state protocols, and shows experimentally that this assumption may be violated in a commercial QKD implementation due to an eavesdropper's malicious manipulation.
Quantum cryptography: An emerging technology in network security
  • M. Sharbaf
  • Computer Science, Mathematics
    2011 IEEE International Conference on Technologies for Homeland Security (HST)
  • 2011
The scope of this research paper is to cover the weaknesses, and the security pitfalls in modern cryptography, fundamental concepts of quantum cryptography, the real — world application implementation of this technology, the future direction in which the quantum cryptography is headed forwards.
Quantum computer architectures: A survey
  • Saumya Jain
  • Computer Science, Physics
    2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom)
  • 2015
To fully utilize the power of a quantum computer, the algorithms used should be based on quantum parallelism, and the paper focuses on different architectures of quantum computer available in literature.
A new quantum algorithm for computing RSA ciphertext period
A new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C is proposed, having higher success probability than Shor's and having the same complexity as Shor’s.
Expanded 128-bit Data Encryption Standard
This paper presents a 128-bit approach on the outdated Data Encryption Standard cipher, wherein the standard bit size is doubled from a size of 64-bits to 128-bits on the key structure and plaintext block to improve its security.
  • D. Boneh
  • Computer Science, Mathematics
  • 1999
A simplified version of RSA encryption is described and a malicious attacker wishing to eavesdrop or tamper with the communication between Alice and Bob is used, to illustrate the dangers of improper use of RSA.
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Performance Analysis of Different Cryptography Algorithms
The basic characteristics (Key Length, Block size) of symmetric (AES, DES, 3DES, BLOWFISH, RC4), Asymmetric (RSA, DSA, Diffie-Hellman, EI-Gamal, Pailier), Hashing (MD5, MD6, SHA, SHA256) algorithms are described.
Quantum Computation and Shor's Factoring Algorithm
The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory, and discuss experiments that may contribute to its practical implementation.