Cryptographic One-way Function Based on Boson Sampling
arXiv:1907.01788 · doi:10.1007/s11128-019-2372-9
Abstract
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 towards cryptographic applications.
27 pages, 10 figures, in production
References in corpus (28)
- Quantum fingerprinting
- Boson Sampling on a Photonic Chip
- Tight bounds on quantum searching
- Practical challenges in quantum key distribution
- Experimental Boson Sampling
- Experimental boson sampling in arbitrary integrated photonic circuits
- Photonic Boson Sampling in a Tunable Circuit
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- On the experimental verification of quantum complexity in linear optics
- Quantum-Secure Authentication with a Classical Key
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- No imminent quantum supremacy by boson sampling
- Quantum Digital Signatures without quantum memory
- Quantum Digital Signatures
- Quantum digital signatures with quantum key distribution components
- Quantum authentication of classical messages
- Experimentally realizable quantum comparison of coherent states and its applications
- Applications of single-qubit rotations in quantum public-key cryptography
- Universality of Generalized Bunching and Efficient Assessment of Boson Sampling
- Quantum walks public key cryptographic system
- Cryptographical Properties of Ising Spin Systems
- Deterministic quantum-public-key encryption: forward search attack and randomization
- Continuous-variable quantum authentication of physical unclonable keys
- Symmetries and security of a quantum-public-key encryption based on single-qubit rotations
- Asymmetric Cryptography with Physical Unclonable Keys
- Continuous-variable quantum authentication of physical unclonable keys: Security against an emulation attack
- Decision and function problems based on boson sampling
- Certification of Boson Sampling Devices with Coarse-Grained Measurements
Cited by in corpus (10)
- Computational advantage of quantum random sampling
- Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
- Proof-of-work consensus by quantum sampling
- Efficient validation of Boson Sampling from binned photon-number distributions
- BosonSampling.jl: A Julia package for quantum multi-photon interferometry
- Efficiently simulating the work distribution of multiple identical bosons with boson sampling
- Photonic Simulation of Localization Phenomena Using Boson Sampling
- Computational indistinguishability and boson sampling
- Generalized Interference of Fermions and Bosons
- Physical Unclonable Functions with Boson Sampling