Shows
ASecuritySite PodcastWorld-leaders in Cryptography: Daniele Micciancio Daniele is a professor in the Computer Science and Engineering department at the University of California, San Diego and, in 2019, he was elected as a Fellow of the IACR. His main focus is on the foundations of lattice-based cryptography and its advanced applications, including fully homomorphic encryption. Overall, he has published many classic papers that relate to lattice methods, including working with Chris Peikert on "Trapdoors for lattices", and with Oded Regev on the "Worst-case to average-case reductions based on Gaussian methods". Daniele has also contributed greatly to the advancement of bootstrapping methods, including defining the DM/FHEW method...
2025-11-211h 38
CK's Cold DiveIdealized Models for FreeTopics* Generic groups.* A trio of interesting papers:* To Label, or Not To Label (in Generic Groups)* The Algebraic Group Model* An Analysis of the Algebraic Group ModelI should also mention that Léo Ducas had some similar ideas way back in 2009If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:If you want even more updates, feel free to check out my blog, and you can even follow me on Twitter. (O...
2023-03-1029 min
Cryptography FMEpisode 14: Schnorr, Factoring and Lattices!On March 1st, 2021, a curious paper appeared on the Cryptology ePrint Archive: senior cryptographer Claus Peter Schnorr submitted research that claims to use lattice mathematics to improve the fast factoring of integers so much that he was able to completely “destroy the RSA cryptosystem” -- certainly a serious claim.
Strangely, while the paper’s ePrint abstract did mention RSA, the paper itself didn’t. Two days later, Schnorr pushed an updated version of the paper, clarifying his method.
Does Schnorr’s proposed method for “destroying RSA” hold water, however? Some cryptographers aren’t convinced. Joining us today is Leo...
2021-03-3046 min