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

arXiv:1210.8251

Cryptography based on operator theory (I): quantum no-key protocols

Yang Li, Min Liang

Published Oct 31, 2012• 1 citation
arXivHTMLPDF

Abstract

We study cryptography based on operator theory, and propose quantum no-key (QNK) protocols from the perspective of operator theory, then present a framework of QNK protocols. The framework is expressed in two forms: trace-preserving quantum operators and natural presentations. Then we defined the information-theoretical security of QNK protocols and the security of identification keys. Two kinds of QNK protocols are also proposed. The first scheme is constructed based on unitary transformation, and the other is constructed based on two multiplicative commutative sets.

DOI
10.48550/arxiv.1210.8251

Related papers

Quantum no-key protocols for secret transmission of quantum and classical message

Li Yang, Min Liang, Bao Li +2 more

A theoretical framework of quantum no-key (QNK) protocol has been presented. As its applications, we develop three kinds of QNK protocols: the practical QNK protocols, the QNK protocol based on quantum perfect encryption, and the QNK protocols based on Boolean function computing. The security of these protocols is based on the laws of quantum mechanics, other than computational hypothesis.

arXiv:1112.0981•Dec 5, 2011•2 citations

A resistant quantum key exchange protocol and its corresponding encryption scheme

Shaowu Mao, Huanguo Zhang, Wanqing Wu +3 more

The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and encryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security, security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.

China Communications•Sep 1, 2014•13 citations

Mathematical Approaches to Quantum Cryptography

Dr. Elena Petrova

Quantum cryptography promises a paradigm shift in secure communications by leveraging the principles of quantum mechanics. This article explores mathematical frameworks central to quantum cryptographic protocols, such as linear algebra, Hilbert spaces, quantum probability, and number theory. It focuses on the theoretical underpinnings of key distribution, quantum security proofs, and error correction. The paper also highlights how mathematical tools like entropic uncertainty relations, complexity theory, and operator algebras underpin advancements in quantum cryptographic systems. These mathematical approaches ensure not only the security but also the efficiency and scalability of next-generation quantum communication networks.

Austra & Lian Journal of Basic Sciences•Feb 28, 2025•0 citations

Indistinguishable encoding for bidirectional quantum key distribution: Theory to experiment

Jesni Shamsul Shaari, Suryadi Suryadi

We present a bidirectional quantum key distribution protocol with minimal encoding operations derived from the use of only two “nonorthogonal” unitary transformations selected from two mutually unbiased unitary bases. Differently from many bidirectional protocols, these transformations are indistinguishable in principle for a single use. Along with its decoding procedure, it is unique compared to its “orthogonal encoding” predecessors. Given the nature of such protocols where key rates are usually dependent on two different types of error rates, we define a more relevant notion of security threshold for such protocols to allow for proper comparisons to be made. The current protocol outperforms its predecessor in terms of security as the amount of information an eavesdropper can glean is limited by the indistinguishability of the transformations. We further propose adaptations for a practical scenario and report on a proof of concept experimental scheme based on polarised photons from an attenuated pulsed laser for qubits, demonstrating the feasibility of such a protocol.

arXiv:1705.03170•Europhysics Letters (EPL)•Dec 1, 2017•8 citations

QUANTUM CRYPTOGRAPHY: A NOVEL APPROACH TO COMMUNICATION SECURITY

A. Porzio

Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.

WORLD SCIENTIFIC eBooks•Oct 10, 2013•0 citations

Quantum no-key protocol with inherent identification

Li Yang, Lei Hu

Various protocols of quantum cryptography has been presented. Some of them can be used to transmit secret messages directly. In this letter we present a new kind of quantum cryptography protocol for direct transmission of classical and quantum messages based on Shamir's generic protocol on classical message encryption. Though Shamir's original idea has only realization of computational security and falls to middle-man attack, our protocol is theoretically secure based on properties of quantum entanglement and Boolean function, and can resist the middle-man attack.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 31, 2006•2 citations
We study cryptography based on operator theory, and propose quantum no-key (QNK) protocols from the perspective of operator theory, then present a framework of QNK protocols. The framework is expressed in two forms: trace-preserving quantum operators and natural presentations. Then we defined the information-theoretical security of QNK protocols and the security of identification keys. Two kinds of QNK protocols are also proposed. The first scheme is constructed based on unitary transformation, and the other is constructed based on two multiplicative commutative sets.
The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and encryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security, security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.
Quantum cryptography promises a paradigm shift in secure communications by leveraging the principles of quantum mechanics. This article explores mathematical frameworks central to quantum cryptographic protocols, such as linear algebra, Hilbert spaces, quantum probability, and number theory. It focuses on the theoretical underpinnings of key distribution, quantum security proofs, and error correction. The paper also highlights how mathematical tools like entropic uncertainty relations, complexity theory, and operator algebras underpin advancements in quantum cryptographic systems. These mathematical approaches ensure not only the security but also the efficiency and scalability of next-generation quantum communication networks.
We present a bidirectional quantum key distribution protocol with minimal encoding operations derived from the use of only two “nonorthogonal” unitary transformations selected from two mutually unbiased unitary bases. Differently from many bidirectional protocols, these transformations are indistinguishable in principle for a single use. Along with its decoding procedure, it is unique compared to its “orthogonal encoding” predecessors. Given the nature of such protocols where key rates are usually dependent on two different types of error rates, we define a more relevant notion of security threshold for such protocols to allow for proper comparisons to be made. The current protocol outperforms its predecessor in terms of security as the amount of information an eavesdropper can glean is limited by the indistinguishability of the transformations. We further propose adaptations for a practical scenario and report on a proof of concept experimental scheme based on polarised photons from an attenuated pulsed laser for qubits, demonstrating the feasibility of such a protocol.
Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.
Various protocols of quantum cryptography has been presented. Some of them can be used to transmit secret messages directly. In this letter we present a new kind of quantum cryptography protocol for direct transmission of classical and quantum messages based on Shamir's generic protocol on classical message encryption. Though Shamir's original idea has only realization of computational security and falls to middle-man attack, our protocol is theoretically secure based on properties of quantum entanglement and Boolean function, and can resist the middle-man attack.