Constructions
summary
Ascon here uses a 320‑bit permutation with a 12/6‑round schedule to deliver Ascon MAC/PRF and a short-input PRF that claims 128‑bit security, resists known key‑recovery up to seven rounds, and yields 3–5× faster software and ~2× throughput with half the energy in hardware versus AES‑GCM; the constructions absorb 256‑bit blocks and squeeze 128‑bit tags for ~4× MAC efficiency. The second construction compiles a quantum PCP into interactive oracle arguments using Merkle trees in the QROM, relies on LWE and QPCP assumptions, and gives a classical verifier with succinct (logarithmic) query communication after a non‑succinct setup.
AI-written summary · about
chapters (12)
- 0:00Ascon introduction and motivation
- 4:40Ascon design principles
- 8:20Authenticated encryption with Ascon
- 11:07Ascon PRF and MAC
- 15:24Security analysis of Ascon
- 18:00Ascon advantages and use cases
- 19:49Q&A: hardware and AES comparison
- 24:06Interactive oracle arguments intro
- 26:39Quantum computing primer
- 31:15Quantum computation to Hamiltonian verification
- 35:29Interactive oracle arguments
- 41:46Conclusion and applications
