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

We propose quantum cryptography based on an algorithm of determining a function using qudit systems. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. An eavesdropper must destroy the entangled state. Consider one of many functions. Alice selec...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of theoretical physics Vol. 59; no. 9; pp. 2875 - 2879
Main Authors Nagata, Koji, Diep, Do Ngoc, Nakamura, Tadao
Format Journal Article
LanguageEnglish
Published New York Springer US 01.09.2020
Springer Nature B.V
Subjects
Algorithms
Cryptography
Elementary Particles
Entangled states
Mathematical and Computational Physics
Physics
Physics and Astronomy
Quantum cryptography
Quantum Field Theory
Quantum Physics
Theoretical
Quantum algorithms
Quantum computation
Quantum cryptography and communication security
Formalism
Quantum communication
Online AccessGet full text

Cover

More Information
Summary:We propose quantum cryptography based on an algorithm of determining a function using qudit systems. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. An eavesdropper must destroy the entangled state. Consider one of many functions. Alice selects a secret function. Bob’s aim is of determining the selected function (a key) without the eavesdropper knows it. To select the same function, in classical case, at the worst case, Bob needs many queries to Alice. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain the selected function. This is faster than classical cryptography.
ISSN:0020-7748
1572-9575
DOI:10.1007/s10773-020-04547-5