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

New Generation Computing

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

Kazuo Ohta, Tetsuro Nishino, Seiya Okubo, Noboru Kunihiro

Published Dec 1, 2003• 0 citations
Publisher
DOI
10.1007/bf03037309

Related papers

Breaking Symmetric Cryptosystems Using Quantum Algorithms

Gaëtan Leurent

•Apr 29, 2017•0 citations

NEW APPROACH TO COMBINE SECRET KEYS FOR POST-QUANTUM (PQ) TRANSITION

Kunal Meher, Divya Midhunchakkaravarthy

Many companies are working to build a powerful quantum computer.Once quantum computer with large qubits is reality, asymmetric-key cryptosystem will be vulnerable for Shor's algorithm.The transition from one cryptosystem to another is very slow process and consumes many years.National Institute of Standards and Technology (NIST) is working on standardization of post-quantum cryptographic (PQC) algorithms.Security of current PQC algorithms cannot be fully verified today.So, in coming years we need to rely on both traditional algorithms and PQC algorithms.Hybrid mode consisting of one traditional algorithm and one post quantum algorithm is a best solution for smooth migration to quantum-safe cryptosystem.For key exchange, it means using two or more key exchange encapsulation algorithms for generating session key [Meher and Midhunchakkaravarthy (2019)].For authentication, it means using two or more digital signature algorithms [Meher and Midhunchakkaravarthy (2019)].There are number of approaches to combine secret key from traditional algorithm and PQC algorithm to make key encapsulation mechanism quantum-proof.In the paper we propose a new approach of using secret master key generated from one of the KEM algorithm as a salt for hashbased key derivation function (HKDF) to drive session keys from secret master key generated from another KEM algorithm.

Indian Journal of Computer Science and Engineering•Jun 25, 2021•3 citations

Quantum-Grid Infinitesimal Bit Cryptosystem

Nabeel A. Siddiqui

The quantum-grid infinitesimal bit cryptosystem presents a unique blend of stream-cipher technology and principles of quantum-physics. This cryptosystem is capable of generating infinite bit keys for encryption of crucial information. This cryptosystem uses protoncentric key exchange mechanism to perform key exchange between communicating entities. The advantage of quantum-cryptography over traditional key exchange methods is that the exchange of information can be shown to be secure in a very strong sense, without making assumptions about the intractability of certain mathematical problems. Even when assuming hypothetical eavesdroppers with unlimited computing power, laws of physics guarantee that the secret key exchange will be secure. It is assumed that possible intruder will have unlimited computing power, hence the algorithm uses three-dimensional key grid to churn the shared secret to generate a key-stream sequence with no repeatability. Apart from robust security, this cryptosystem has the capability to encrypt enormous amount of data of any format on high-speed communication channels.

International Conference on Signal Processing and Communications (SPCOM)•Jan 1, 2007•2 citations

Key Insights on the Use of Quantum Computing in Breaking Cryptographic Algorithms

Khemant Nirvaan Degambur, Girish Bekaroo

Progress in IS•Jan 1, 2026•0 citations

The Theoretical Rationale for Using Quantum Computers to Crack Cryptosystems

Yulia Andrusenko, Dmitry Lukyanov, Alexey Dmitrienko +2 more

Lecture notes in networks and systems•Nov 17, 2025•0 citations

Classical and quantum cryptography

E. Desurvire

This final chapter concerns cryptography , the principle of securing information against access or tampering by third parties. Classical cryptography refers to the manipulation of classical bits for this purpose, while quantum cryptography can be viewed as doing the same with qubits . I describe these two approaches in the same chapter, as in my view the field of cryptography should be understood as a whole and appreciated within such a broader framework, as opposed to focusing on the specific applications offered by the quantum approach. I, thus, begin by introducing the notions of message encryption , message decryption , and code breaking , the action of retrieving the message information contents without knowledge of the code's secret algorithm or secret key . I then consider the basic algorithms to achieve encryption and decryption with binary numbers, which leads to the early IBM concept of the Lucifer cryptosystem , which is the ancestor of the first data encryption standard (DES). The principle of double-key encryption , which alleviates the problem of key exchange , is first considered as an elegant solution but it is unsafe against code-breaking. Then the revolutionary principles of cryptography without key exchange and public-key cryptography (PKC) are considered, the latter also being known as RSA . The PKC–RSA cryptosystem is based on the extreme difficulty of factorizing large numbers . This is the reason for the description made earlier in Chapter 20 concerning Shor's factorization algorithm .

Cambridge University Press eBooks•Feb 19, 2009•2 citations
Many companies are working to build a powerful quantum computer.Once quantum computer with large qubits is reality, asymmetric-key cryptosystem will be vulnerable for Shor's algorithm.The transition from one cryptosystem to another is very slow process and consumes many years.National Institute of Standards and Technology (NIST) is working on standardization of post-quantum cryptographic (PQC) algorithms.Security of current PQC algorithms cannot be fully verified today.So, in coming years we need to rely on both traditional algorithms and PQC algorithms.Hybrid mode consisting of one traditional algorithm and one post quantum algorithm is a best solution for smooth migration to quantum-safe cryptosystem.For key exchange, it means using two or more key exchange encapsulation algorithms for generating session key [Meher and Midhunchakkaravarthy (2019)].For authentication, it means using two or more digital signature algorithms [Meher and Midhunchakkaravarthy (2019)].There are number of approaches to combine secret key from traditional algorithm and PQC algorithm to make key encapsulation mechanism quantum-proof.In the paper we propose a new approach of using secret master key generated from one of the KEM algorithm as a salt for hashbased key derivation function (HKDF) to drive session keys from secret master key generated from another KEM algorithm.
The quantum-grid infinitesimal bit cryptosystem presents a unique blend of stream-cipher technology and principles of quantum-physics. This cryptosystem is capable of generating infinite bit keys for encryption of crucial information. This cryptosystem uses protoncentric key exchange mechanism to perform key exchange between communicating entities. The advantage of quantum-cryptography over traditional key exchange methods is that the exchange of information can be shown to be secure in a very strong sense, without making assumptions about the intractability of certain mathematical problems. Even when assuming hypothetical eavesdroppers with unlimited computing power, laws of physics guarantee that the secret key exchange will be secure. It is assumed that possible intruder will have unlimited computing power, hence the algorithm uses three-dimensional key grid to churn the shared secret to generate a key-stream sequence with no repeatability. Apart from robust security, this cryptosystem has the capability to encrypt enormous amount of data of any format on high-speed communication channels.
This final chapter concerns cryptography , the principle of securing information against access or tampering by third parties. Classical cryptography refers to the manipulation of classical bits for this purpose, while quantum cryptography can be viewed as doing the same with qubits . I describe these two approaches in the same chapter, as in my view the field of cryptography should be understood as a whole and appreciated within such a broader framework, as opposed to focusing on the specific applications offered by the quantum approach. I, thus, begin by introducing the notions of message encryption , message decryption , and code breaking , the action of retrieving the message information contents without knowledge of the code's secret algorithm or secret key . I then consider the basic algorithms to achieve encryption and decryption with binary numbers, which leads to the early IBM concept of the Lucifer cryptosystem , which is the ancestor of the first data encryption standard (DES). The principle of double-key encryption , which alleviates the problem of key exchange , is first considered as an elegant solution but it is unsafe against code-breaking. Then the revolutionary principles of cryptography without key exchange and public-key cryptography (PKC) are considered, the latter also being known as RSA . The PKC–RSA cryptosystem is based on the extreme difficulty of factorizing large numbers . This is the reason for the description made earlier in Chapter 20 concerning Shor's factorization algorithm .