Cryptographic one-way function based on boson sampling

The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions stand out as fundamental building blocks of more complex cryp...

Full description

Saved in:
Bibliographic Details
Published inQuantum information processing Vol. 18; no. 8; pp. 1 - 25
Main Author Nikolopoulos, Georgios M.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.08.2019
Springer Nature B.V
Subjects
Cryptography
Data Structures and Information Theory
Mathematical Physics
Physics
Physics and Astronomy
Quantum computers
Quantum Computing
Quantum Information Technology
Quantum Physics
Quarks
Robustness (mathematics)
Sampling
Spintronics
Quantum public-key cryptography
Boson sampling
Quantum one-way function
Online AccessGet full text

Cover

More Information
Summary:The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions stand out as fundamental building blocks of more complex cryptographic protocols, and they play a central role in modern asymmetric cryptography. We propose a mathematical one-way function, which relies on coarse-grained boson sampling. The evaluation and the inversion of the function are discussed in the context of classical and quantum computers. The present results suggest that the scope and power of boson sampling may go beyond the proof of quantum supremacy and pave the way toward cryptographic applications.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-019-2372-9