Simple High-Level Code for Cryptographic Arithmetic -- With Proofs, Without Compromises
Presenters detail vulnerability discovery and exploitation in Simple High-Level Code for Cryptographic Arithmetic -- With Proofs, Without Compromises.
Summary
No summary yet — watch the video above, or open it on YouTube.
Related talks
IEEE Symposium on Security and Privacy·17 min
Security researchers examine technical aspects of 75 Serberus Protecting Cryptographic Code frrom Spectres at Compile Time Nicholas Hunter Mosier.
serberuprotectingcryptographic+3
IEEE Symposium on Security and Privacy·13 min
Engineers explore architecture and security mechanisms for Weak Fiat-Shamir Attacks on Modern Proof Systems.
weakfiat-shamirattack+3
IEEE Symposium on Security and Privacy·15 min
Engineers explore architecture and security mechanisms for Practically-Exploitable Cryptographic Vulnerabilities in Matrix.
vulnerabilitiespractically-exploitablecryptographic+3