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

European Journal of Pure and Applied Mathematics

Group and Cipher in Wormhole and Quantum Entanglement

Yonghong Liu

Published May 18, 2021• 0 citations
Publisher

Abstract

In this article, we present wormholes cryptosystems (WCS). The first is the wormhole key distribution centre theorem, which asserts that the WCS is a public key group. The second is the security theorem, which asserts that the WCS are a one-way function. The third is new version of the definition for the WCS, and we introduce the notion of groups of WCS. The fourth ingredient is the encryption algorithm and decryption algorithm, and design principle. Here, we present a toy example to illustrate the computation of these encryptions and decryptions. The finally we present the unsymmetrical WCS theorem.

DOI
10.29020/nybg.ejpam.v14i2.3972

Related papers

Quantum Public-Key Cryptosystems

Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama

Abstract. This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) poly-time Turing (QPT) machines and only classical channels (i.e., no quantum channels) are employed. A quantum trapdoor one-way function, f, plays an essential role in our system, in which a QPT machine can compute f with high probability, any QPT machine can invert f with negligible probability, and a QPT machine with trapdoor data can invert f. This paper proposes a concrete scheme for quantum public-key cryptosystems: a quantum public-key encryption scheme or quantum trapdoor one-way function. The security of our schemes is based on the computational assumption (over QPT machines) that a class of subset-sum problems is intractable against any QPT machine. Our scheme is very efficient and practical if Shor’s discrete logarithm algorithm is efficiently realized on a quantum machine.

•Nov 30, 2006•1 citation

Quantum Cryptography

Salma Fauzia

A cryptosystem is a collection of algorithms used to securely encrypt or decrypt messages by transforming plaintext to ciphertext. The abbreviation “cryptosystem” stands for “cryptographic system” and designates a computer system that employs cryptography, a technique for securing electronic information so only authorized users may read and process it. Prototype quantum cryptography devices are now securing Internet traffic in the nation's largest cities. The third and final major development in the evolution of cryptography in the 20th century might be regarded as quantum key distribution i.e. QKD or quantum cryptography. The level of security of the cryptographic scheme depends on the key employed. A secure message, such as a credit card number or other sensitive information, is sent over the internet using cryptosystems. For instance, a platform for secured electronic mail might incorporate key management procedures, strong cryptographic functions, and digital signature systems. Another use of cryptography may be a secure electronic mail system that uses key management procedures, cryptographic hash functions, and digital signature mechanisms. The following is a breakdown of the chapter's structure. The fundamentals of classical cryptography, symmetric and asymmetric encryption are described in Section 14.1. The principle of quantum cryptography is presented in Section 14.2. The Quantum Key Distribution Protocols are discussed in Section 14.3. The impact of the sifting and distillation steps on the key size is Section 14.4, crypt-analysis in Section 14.5, Quantum Key Distribution in the real world and conclusions are discussed in Section 14.6.

Wiley eBooks•May 29, 2023•2 citations

Asymmetrical Quantum Cryptographic Algorithm

Guihua Zeng, C. Saavedra, Christoph H. Keitel

A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical and dynamical public key distribution. The use of public keys leads to a high availability of our scheme, while their quantum nature is shown to ensure unconditional security of the proposed algorithm.

arXiv:quant-ph/0202021•Feb 4, 2002•3 citations

Applications of single-qubit rotations in quantum public-key cryptography

Georgios M. Nikolopoulos

We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo's theorem.

arXiv:0801.2840•Physical Review A•Mar 28, 2008•102 citations

量子アルゴリズム・量子暗号の研究

健史 小柴

This report describes properties of basic cryptographic primitives (quantum public-key cryptosystmes and quantum one-way functions) in the quantum world where quantum computers are available. Some quantum public-key cryptosystems have already proposed. However, the security requirements for quantum public-key cryptosystems are not studied well. We propose several security notions for quantum public-key cryptosystems and discuss relation among them. In the classical setting, the notion of one-way permutations plays an essential role in cryptology. Even in the quantum setting, quantum one-way permutations are expected to play again an essential role in quantum cryptography. However, we do not have any candidates so far. So, we give a characterization of quantum one-way permutations.

•Jan 1, 2008•0 citations

Security Notions for Quantum Public-Key Cryptography

Takeshi Koshiba

It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.

arXiv:quant-ph/0702183•Feb 19, 2007•13 citations
In this article, we present wormholes cryptosystems (WCS). The first is the wormhole key distribution centre theorem, which asserts that the WCS is a public key group. The second is the security theorem, which asserts that the WCS are a one-way function. The third is new version of the definition for the WCS, and we introduce the notion of groups of WCS. The fourth ingredient is the encryption algorithm and decryption algorithm, and design principle. Here, we present a toy example to illustrate the computation of these encryptions and decryptions. The finally we present the unsymmetrical WCS theorem.
Abstract. This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) poly-time Turing (QPT) machines and only classical channels (i.e., no quantum channels) are employed. A quantum trapdoor one-way function, f, plays an essential role in our system, in which a QPT machine can compute f with high probability, any QPT machine can invert f with negligible probability, and a QPT machine with trapdoor data can invert f. This paper proposes a concrete scheme for quantum public-key cryptosystems: a quantum public-key encryption scheme or quantum trapdoor one-way function. The security of our schemes is based on the computational assumption (over QPT machines) that a class of subset-sum problems is intractable against any QPT machine. Our scheme is very efficient and practical if Shor’s discrete logarithm algorithm is efficiently realized on a quantum machine.
A cryptosystem is a collection of algorithms used to securely encrypt or decrypt messages by transforming plaintext to ciphertext. The abbreviation “cryptosystem” stands for “cryptographic system” and designates a computer system that employs cryptography, a technique for securing electronic information so only authorized users may read and process it. Prototype quantum cryptography devices are now securing Internet traffic in the nation's largest cities. The third and final major development in the evolution of cryptography in the 20th century might be regarded as quantum key distribution i.e. QKD or quantum cryptography. The level of security of the cryptographic scheme depends on the key employed. A secure message, such as a credit card number or other sensitive information, is sent over the internet using cryptosystems. For instance, a platform for secured electronic mail might incorporate key management procedures, strong cryptographic functions, and digital signature systems. Another use of cryptography may be a secure electronic mail system that uses key management procedures, cryptographic hash functions, and digital signature mechanisms. The following is a breakdown of the chapter's structure. The fundamentals of classical cryptography, symmetric and asymmetric encryption are described in Section 14.1. The principle of quantum cryptography is presented in Section 14.2. The Quantum Key Distribution Protocols are discussed in Section 14.3. The impact of the sifting and distillation steps on the key size is Section 14.4, crypt-analysis in Section 14.5, Quantum Key Distribution in the real world and conclusions are discussed in Section 14.6.
We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo's theorem.
This report describes properties of basic cryptographic primitives (quantum public-key cryptosystmes and quantum one-way functions) in the quantum world where quantum computers are available. Some quantum public-key cryptosystems have already proposed. However, the security requirements for quantum public-key cryptosystems are not studied well. We propose several security notions for quantum public-key cryptosystems and discuss relation among them. In the classical setting, the notion of one-way permutations plays an essential role in cryptology. Even in the quantum setting, quantum one-way permutations are expected to play again an essential role in quantum cryptography. However, we do not have any candidates so far. So, we give a characterization of quantum one-way permutations.
It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.