1 citations · 1 across the 3 of their papers we have counts for
Showing 2025 · quant-phShow all
2 papers · 2 filters
quant-ph2025
Compressed Permutation Oracles
Joseph Carolan
The analysis of quantum algorithms which query random, invertible permutations has been a long-standing challenge in cryptography. Many techniques which apply to random oracles fai…
quant-ph2025
The Sponge is Quantum Indifferentiable
Gorjan Alagic, Joseph Carolan, Christian Majenz +1
The sponge is a cryptographic construction that turns a public permutation into a hash function. When instantiated with the Keccak permutation, the sponge forms the NIST SHA-3 stan…