Cryptographic Implementations
summary
Finds a buffer overflow in XKCP SHA-3 implementations that triggers when an init update update final sequence uses a first chunk of size x and a second of 4GB − x, enabling arbitrary code execution and an infinite loop on 4GB updates; the bug traces to a wrong minimum/overflow rewrite, gets a CVE and upstream fixes, and prompts a proposed Init-Update-Final Test IUFT and CodeQL searches. Separately, HElib noise analysis models variance, validates with 10,000 trials, and yields a 25‑bit improvement in parameter bounds versus prior settings.
AI-written summary · about
chapters (10)
- 0:00Hash function fundamentals
- 5:13Analyzing hash vulnerabilities
- 9:18SHA-3 implementation flaws
- 13:33Code fixes and exploitation
- 17:56Systematic vulnerability tools
- 21:20Vulnerability Q&A session
- 24:41FHE noise fundamentals
- 30:23Noise analysis techniques
- 35:36Evaluating experimental results
- 40:20Optimization and tradeoffs
related talks
46mLessons From Two Years of Crypto Audits
51mFed Up Getting Shattered and Log Jammed? A New Generation of Crypto Is Coming
13mEnabling Crypto Agility by Immunizing Processors Against the Exploitation of Software Bugs
36mSmall Leaks, Billions Of Dollars: Practical Cryptographic Exploits That Undermine Crypto Wallets
40mImplementation
24mImplementing the Post-Quantum Survivors: A Retrospective
51m48 Dirty Little Secrets Cryptographers Don’t Want You To Know
36mSupply Auditing