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

Multi-power Post-quantum RSA.

John M. Schanck

Published Jan 1, 2018• 1 citation
OpenAlex

Related papers

Post-quantum RSA

Daniel J. Bernstein, Nadia Heninger, Paul Lou +1 more

Lecture notes in computer science•Jan 1, 2017•107 citations

Implementation and Analysis of Shor's Algorithm to Break RSA Cryptosystem Security

Siyon Singh, Eric Sakk

The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.

•Dec 14, 2023•1 citation

Post-Quantum Cryptography Implementation.

Ryan Vaughan

•Nov 6, 2023•0 citations

Implementation and Analysis of Shor's Algorithm to Break RSA Cryptosystem Security

Siyon Singh, Eric Sakk

The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.

•Jan 8, 2024•11 citations

Post-Quantum Cryptography – Solutions

Jonathan Katz

Chapman & Hall/CRC eBooks•Apr 1, 2026•0 citations

Secret Key Generation Over Multi-Mode Fiber: Channel Measurements, Key Rate Analysis, and System Implementation

Pin-Hsun Lin, Paul Nowitzki, Eduard Axel Jorswieck +2 more

Secret keys are critical for many security mechanisms including secure data transmission. An efficient secret key generation and sharing scheme enhances the secure transmission rate. Meanwhile, secret keys are scarce resources for classical encryption schemes like the Rivest-Shamir-Adleman (RSA) cryptosystem and its post-quantum security counterparts in quantum applications. Therefore, harnessing every available random source for secret key extraction is crucial for maximizing the key rate across a range of potential applications. In this paper, we investigate the achievable rate of the secret key generation (SKG)-channel-model based on an actual measured multi-mode fiber (MMF) channel, where there is an additional public discussion channel between the legitimate parties, which the adversary can perfectly overhear. In particular, we first measure the MMF transmission matrix using digital holography, then design power allocation schemes among the modes. Our schemes can achieve a positive secret key rate at 51.3 bit per channel use, under a mode-dependent loss of 1 dB and a transmit power of 20 dBm. In addition, we implement an SKG system via MMF by explicitly designing the wiretap codes and discussion protocol. More specifically, we design the hash function and point-to-point channel encoder/decoder for each mode in the MMF based on Hayashi’s wiretap coding. The designed system can achieve a secret key rate-leakage trade-off at$R_{SK} = 23.6$bits per channel use and an average leakage rate at$ 4.22 \cdot 10^{-3}$bits per channel use per mode, at the transmit power$\textsf {P}_{T}$at 50 dBm and mode-dependent loss at 1 dB with the error probability constraint at Bob as$10^{-5}$. This demonstrates the feasibility and effectiveness of generating SKG via MMF, aligning with the common approaches of post-quantum cryptography and quantum key distribution in addressing the challenges posed by emerging quantum computers.

IEEE Open Journal of the Communications Society•Jan 1, 2025•6 citations
The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.
The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.
Secret keys are critical for many security mechanisms including secure data transmission. An efficient secret key generation and sharing scheme enhances the secure transmission rate. Meanwhile, secret keys are scarce resources for classical encryption schemes like the Rivest-Shamir-Adleman (RSA) cryptosystem and its post-quantum security counterparts in quantum applications. Therefore, harnessing every available random source for secret key extraction is crucial for maximizing the key rate across a range of potential applications. In this paper, we investigate the achievable rate of the secret key generation (SKG)-channel-model based on an actual measured multi-mode fiber (MMF) channel, where there is an additional public discussion channel between the legitimate parties, which the adversary can perfectly overhear. In particular, we first measure the MMF transmission matrix using digital holography, then design power allocation schemes among the modes. Our schemes can achieve a positive secret key rate at 51.3 bit per channel use, under a mode-dependent loss of 1 dB and a transmit power of 20 dBm. In addition, we implement an SKG system via MMF by explicitly designing the wiretap codes and discussion protocol. More specifically, we design the hash function and point-to-point channel encoder/decoder for each mode in the MMF based on Hayashi’s wiretap coding. The designed system can achieve a secret key rate-leakage trade-off atRSK=23.6R_{SK} = 23.6RSK​=23.6bits per channel use and an average leakage rate at$ 4.22 \cdot 10^{-3}bitsperchannelusepermode,atthetransmitpowerbits per channel use per mode, at the transmit powerbitsperchannelusepermode,atthetransmitpower\textsf {P}_{T}$at 50 dBm and mode-dependent loss at 1 dB with the error probability constraint at Bob as10−510^{-5}10−5. This demonstrates the feasibility and effectiveness of generating SKG via MMF, aligning with the common approaches of post-quantum cryptography and quantum key distribution in addressing the challenges posed by emerging quantum computers.