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

Journal of Information Security and Applications

Efficient quantum algorithms to break group ring cryptosystems

Ann Dooms, Carlo Emerencia

Published Nov 26, 2024• 3 citations
Publisher
DOI
10.1016/j.jisa.2024.103923

Related papers

Breaking Symmetric Cryptosystems Using Quantum Algorithms

Gaëtan Leurent

•Apr 29, 2017•0 citations

A quantum algorithm using NMR computers to break secret-key cryptosystems

Kazuo Ohta, Tetsuro Nishino, Seiya Okubo +1 more

New Generation Computing•Dec 1, 2003•0 citations

Efficient Implementation and Analysis of Ring-LWE Quantum-Secure Key Exchange Protocol

Simran Choudhary, Anil Kumar Gupta

The only known threat to some symmetric cryptographic schemes like DES is Grover’s algorithm that proposes a square root speed-up over classical brute force algorithms. NIST [14] points out that if the key sizes are sufficient, symmetric cryptographic schemes (specifically the Advanced Encryption Standard-AES) are resistant to quantum computers. The development of quantum computer is on full pace, hopefully it might be available in a decade. Thus, it is necessary to develop efficient quantum secure public key cryptosystems to provide safe key exchange in quantum era. In this paper we presented an efficient implementation of a Ring-Learning with errors public key cryptosystem whose security is based on intractability of hard problem on lattices. And comparative analysis of proposed cryptosystem with RSA, ECDH and LWE based key exchange protocols is presented.

•Jan 1, 2018•0 citations

Quantum Cryptography and Computation

ARTUR K. EKERT

NATO ASI series. Series B : Physics•Jan 1, 1995•0 citations

How to use Classical Operation in Digital Bits to Simulate Quantum Bits for the RSA Cryptosystem

Jun-Ya Wang, Xui-Chengn Chang, Hung-Ju Wang

In quantum algorithm, the Shor's algorithm can find prime decomposition of very big numbers easily and break RSA encryption much faster and more efficiently than in the classical case. How to complicant the public key to slow down the speed and efficiency of Shor's algorithm to secure our RSA encryption scheme is main issue in this study. By using classical random simulation to operation as quantum bits to complicate the RSA cryptosystem, even Shor's algorithm can not to find prime decomposition of very big numbers n with qubits random simulation easily.

•Jul 29, 2023•0 citations

A Lattice-Based Group Authentication Scheme

Jheng-Jia Huang, Yi‐Fan Tseng, Qiliang Yang +1 more

Authentication has been adopted in many areas, but most of these authentication schemes are built using traditional cryptographic primitives. It is widely believed that such primitives are not resistant to quantum algorithms. To deal with those quantum attacks, lattice-based cryptography was introduced by Ajtai in 1996. To the best of our knowledge, the existing lattice-based authentication schemes are based on a lattice-based public key encryption called NTRU: a ring-based public key cryptosystem, proposed by Hoffstein, Pipher, and Silverman in 1998. However, these schemes only support the case of a single user. In view of the aforementioned issue, we propose the first lattice-based group authentication scheme. The proposed scheme is secure against replay attacks and man-in-the-middle attacks. Moreover, compared with the existing lattice-based authentication schemes, ours provides the most efficient method to agree upon a session key among a group of users after mutual authentication.

Applied Sciences•Jun 15, 2018•4 citations
The only known threat to some symmetric cryptographic schemes like DES is Grover’s algorithm that proposes a square root speed-up over classical brute force algorithms. NIST [14] points out that if the key sizes are sufficient, symmetric cryptographic schemes (specifically the Advanced Encryption Standard-AES) are resistant to quantum computers. The development of quantum computer is on full pace, hopefully it might be available in a decade. Thus, it is necessary to develop efficient quantum secure public key cryptosystems to provide safe key exchange in quantum era. In this paper we presented an efficient implementation of a Ring-Learning with errors public key cryptosystem whose security is based on intractability of hard problem on lattices. And comparative analysis of proposed cryptosystem with RSA, ECDH and LWE based key exchange protocols is presented.
In quantum algorithm, the Shor's algorithm can find prime decomposition of very big numbers easily and break RSA encryption much faster and more efficiently than in the classical case. How to complicant the public key to slow down the speed and efficiency of Shor's algorithm to secure our RSA encryption scheme is main issue in this study. By using classical random simulation to operation as quantum bits to complicate the RSA cryptosystem, even Shor's algorithm can not to find prime decomposition of very big numbers n with qubits random simulation easily.
Authentication has been adopted in many areas, but most of these authentication schemes are built using traditional cryptographic primitives. It is widely believed that such primitives are not resistant to quantum algorithms. To deal with those quantum attacks, lattice-based cryptography was introduced by Ajtai in 1996. To the best of our knowledge, the existing lattice-based authentication schemes are based on a lattice-based public key encryption called NTRU: a ring-based public key cryptosystem, proposed by Hoffstein, Pipher, and Silverman in 1998. However, these schemes only support the case of a single user. In view of the aforementioned issue, we propose the first lattice-based group authentication scheme. The proposed scheme is secure against replay attacks and man-in-the-middle attacks. Moreover, compared with the existing lattice-based authentication schemes, ours provides the most efficient method to agree upon a session key among a group of users after mutual authentication.