Quantum one-wayness of the single-round sponge with invertible permutations
From MaRDI portal
Publication:6652987
DOI10.1007/978-3-031-68391-6_7MaRDI QIDQ6652987FDOQ6652987
Authors: Joseph Carolan, Alexander Poremba 
Publication date: 13 December 2024
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Strengths and Weaknesses of Quantum Computing
- On the Indifferentiability of the Sponge Construction
- The tail of the hypergeometric distribution
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Random oracles in a quantum world
- Title not available (Why is that?)
- A combinatorial approach to the double cosets of the symmetric group with respect to Young subgroups
- Exact quantum lower bound for Grover's problem
- Post-quantum security of the Even-Mansour cipher
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- Redeeming reset indifferentiability and applications to post-quantum security
- On time-space lower bounds for finding short collisions in sponge hash functions
- Towards compressed permutation oracles
This page was built for publication: Quantum one-wayness of the single-round sponge with invertible permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652987)
