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

Institute of Physics eBooks

Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a logical function

Koji Nagata, Do Ngoc Diep, Ahmed Farouk, Tadao Nakamura

Published Jul 1, 2022• 1 citation
Publisher
DOI
10.1088/978-0-7503-4700-6ch9

Related papers

Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function

Koji Nagata, Renata Wong, Do Ngoc Diep +1 more

Quantum Studies Mathematics and Foundations•Feb 10, 2023•2 citations

Quantum Cryptography Based on an Algorithm for Determining a Function Using Qudit Systems

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

International Journal of Theoretical Physics•Jul 17, 2020•2 citations

Quantum cryptography based on an algorithm for determining a function using qudit systems

Koji Nagata, Do Ngoc Diep, Ahmed Farouk +1 more

Institute of Physics eBooks•Jul 1, 2022•0 citations

Quantum Cryptography Through Some Algorithm for Quantum Computers

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.

•Jan 1, 2020•0 citations

A map for simultaneous measurements for a quantum logic

Oľga Nánásiová

In this paper we will study a function of simultaneus measurements for quantum events (s-map) which will be compared with the conditional states on an orthomodular lattice as a basic structure for quantum logic.

arXiv:math/0306026•Jun 2, 2003•3 citations

Quantum Cryptography and Quantum Computation

John Rarity

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jan 1, 1996•1 citation
We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.