A quantum hash function with grouped coarse-grained boson sampling
From MaRDI portal
Publication:2102295
DOI10.1007/S11128-022-03416-WOpenAlexW4221041140MaRDI QIDQ2102295FDOQ2102295
Duan Huang, Xiaoping Lou, Jinjing Shi, Ronghua Shi, Yanyan Feng, Yuhu Lu, Qin Li
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03416-w
Recommendations
Cites Work
- Title not available (Why is that?)
- Fast Software Encryption
- The Classical Complexity of Boson Sampling
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
- The computational complexity of linear optics
- Title not available (Why is that?)
- One Way Hash Functions and DES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- How to Break MD5 and Other Hash Functions
- RIPEMD with two-round compress function is not collision-free
- Discrete-time interacting quantum walks and quantum hash schemes
- Analysis of the two-particle controlled interacting quantum walks
- Title not available (Why is that?)
- Quantum cryptanalysis of hash and claw-free functions
- Cryptanalysis of MD4
- Simple hash function using discrete-time quantum walks
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Cryptographic one-way function based on boson sampling
- The bosonic birthday paradox
- Arbitrated quantum signature protocol with boson sampling-based random unitary encryption
Cited In (2)
Uses Software
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)