Cryptographic one-way function based on boson sampling
From MaRDI portal
Publication:2106039
DOI10.1007/S11128-019-2372-9OpenAlexW2954891490WikidataQ106529345 ScholiaQ106529345MaRDI QIDQ2106039FDOQ2106039
Authors: Georgios M. Nikolopoulos
Publication date: 8 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01788
Recommendations
Cites Work
- The classical complexity of boson sampling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Cryptography
- The computational complexity of linear optics
- Title not available (Why is that?)
- Quantum McEliece public-key cryptosystem
- Bit-oriented quantum public-key encryption based on quantum perfect encryption
- Applications of single-qubit rotations in quantum public-key cryptography
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application
- Introduction to post-quantum cryptography
- Public-key cryptography based on bounded quantum reference frames
- Public-key quantum digital signature scheme with one-time pad private-key
- Quantum walk public-key cryptographic system
- Cryptography. Theory and practice
- Probability and statistics for computer scientists
- Everyday cryptography. Fundamental principles and applications.
Cited In (4)
Uses Software
This page was built for publication: Cryptographic one-way function based on boson sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106039)