Paper 2021/758
Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function
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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- Quantum cryptography Quantum communication Quantum computation Quantum algorithms Boolean algebra
- Contact author(s)
-
ko_mi_na @ yahoo co jp
renata wong kei @ gmail com
dndiep @ math ac vn
nakamura @ pipelining jp - History
- 2022-07-08: revised
- 2021-06-07: received
- See all versions
- Short URL
- https://ia.cr/2021/758
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/758,
author = {Koji Nagata and Renata Wong and Do Ngoc Diep and Tadao Nakamura},
title = {Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/758},
year = {2021},
url = {https://eprint.iacr.org/2021/758}
}
