Post-Quantum
summary
Survey extracts concrete rules: lattice signatures use TPSF/ATPSF instantiations (Falcon, Wave) to get provable security; many early implementations fail from data-dependent branches and non-constant-time Fujisaki-Okamoto checks; masking is harder than expected and benchmarking shows Cortex‑M4 seed expansion 50–70% of runtime for some schemes. New lattice algorithmics deliver a complete heuristic analysis showing dual attacks excel for BDD; primal for approximate CVP, with experiments matching theory. A reduction proves Module‑LWE with binary secrets hard only if module rank is super‑logarithmic, leaving constant‑rank cases open.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 2:25Theory Design
- 7:05Challenges
- 13:30Dual Attacks
- 20:10Results
- 22:10Conclusion
- 23:57Purpose
- 27:51Why MLWE
- 29:26Overview
- 30:29Construction
- 31:54Binary MLW
- 33:41Summary
related talks
01h 40mHistorical Talk on Lattice-Based Cryptography
58mQuantum 2
28mPost-Quantum Manifesto
01h 02mLattices and the NIST PQ-crypto Standardization Process
39mLattice Based Cryptography Primer
01h 06mAn introduction to lattice-based folding schemes
01h 08mCryptography from Ideal Lattices
57mAlgorithms for Lattice Problems, in Practice