[Resource Topic] 2021/758: Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function

Welcome to the resource topic for 2021/758

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

Authors: Koji Nagata, Renata Wong, Do Ngoc Diep, and Tadao Nakamura

Abstract:

We study a quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function using an entangled state. The security of our cryptography is based on the Ekert 1991 protocol, which uses an entangled state. Eavesdropping destroys the entanglement. Alice selects a secret function from the number of possible function types. Bob’s aim is then to determine the selected function (a key) without an eavesdropper learning it. In order for both Alice and Bob to be able to select the same function classically, in the worst case Bob requires multiple queries to Alice. In the quantum case however, Bob requires just a single query. By measuring the single entangled state, which is sent to him by Alice, Bob can obtain the function that Alice selected. This quantum key distribution method is faster compared to the multiple queries that would be required in the classical case.

ePrint: https://eprint.iacr.org/2021/758

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .