A quantum hash function with grouped coarse-grained boson sampling
From MaRDI portal
Publication:2102295
Recommendations
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 4072862 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1302838 (Why is no real title available?)
- scientific article; zbMATH DE number 503258 (Why is no real title available?)
- scientific article; zbMATH DE number 1024001 (Why is no real title available?)
- scientific article; zbMATH DE number 1394313 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Analysis of the two-particle controlled interacting quantum walks
- Arbitrated quantum signature protocol with boson sampling-based random unitary encryption
- Cryptanalysis of MD4
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- Cryptographic one-way function based on boson sampling
- Discrete-time interacting quantum walks and quantum hash schemes
- Fast Software Encryption
- How to Break MD5 and Other Hash Functions
- Mathematical Foundations of Computer Science 2005
- One Way Hash Functions and DES
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum cryptanalysis of hash and claw-free functions
- RIPEMD with two-round compress function is not collision-free
- Simple hash function using discrete-time quantum walks
- The bosonic birthday paradox
- The classical complexity of boson sampling
- The computational complexity of linear optics
Cited in
(3)
This page was built for publication: A quantum hash function with grouped coarse-grained boson sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102295)