Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Breaking RSA encryption

N. David Mermin

Published Aug 30, 2007• 0 citations
Publisher
DOI
10.1017/cbo9780511813870.005

Related papers

The Cruicality of Shor's Algorithm In Breaking RSA Encryption

Bilisuma Merga

•Jan 1, 2024•1 citation

Simple identity-based encryption with mediated RSA

Xuhua Ding, Gene Tsudik

•Jan 1, 2013•2 citations

Leveraging the power of quantum computing for breaking RSA encryption

Moolchand Sharma, Vikas Choudhary, R. S. Bhatia +3 more

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 traditional computing, the recent developments in the field of quantum computing can be utilised to break RSA Encryption. The approach involves mapping of qubits used in a quantum machine to a constraint satisfaction problem (CSP) and then using them to check for factors. This consists of the use of a Multiplicative Boolean circuit in which the qubits utilised by the machine replaces the variables. These Qubits are then mapped as per the gates involved, and the factorization problem is thus transformed into a CSP problem, through which, the factors can be easily found. Once known, these factors can be used to calculate the public and private keys effectively breaking the encryption security. We provide a novel approach to highlight the importance of developing Post-Quantum cryptography techniques for providing a secure channel of communication.

Cyber-Physical Systems•Sep 3, 2020•52 citations

Factorizing RSA Keys

Ed Blakey

Proceedings in information and communications technology•Dec 17, 2008•2 citations

Breaking RSA with Quantum Computing

Blaz Bacnik

We take a look at RSA encryption algorithm and what makes it secure. Some consideration is given to its current use, showing that it plays an important role in ensuring privacy on the Internet. A way of factoring large numbers with Shor’s factorization algorithm is given, as well as a shortcut to directly breaking RSA. Next, we present basics of some of the implementations, their drawbacks and make an estimation of how long will our RSA keys remain safe.

•Jan 1, 2008•2 citations

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation
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 traditional computing, the recent developments in the field of quantum computing can be utilised to break RSA Encryption. The approach involves mapping of qubits used in a quantum machine to a constraint satisfaction problem (CSP) and then using them to check for factors. This consists of the use of a Multiplicative Boolean circuit in which the qubits utilised by the machine replaces the variables. These Qubits are then mapped as per the gates involved, and the factorization problem is thus transformed into a CSP problem, through which, the factors can be easily found. Once known, these factors can be used to calculate the public and private keys effectively breaking the encryption security. We provide a novel approach to highlight the importance of developing Post-Quantum cryptography techniques for providing a secure channel of communication.