Episode 14: Schnorr, Factoring and Lattices!

Episode 14: Schnorr, Factoring and Lattices!

Did Schnorr "destroy RSA" with his surprising ePrint submission? Lattice cryptography expert Léo Ducas joins Nadim from CWI, Amsterdam to discuss this topic and more on Cryptography FM.
47 Minuten
Podcast
Podcaster
In-depth, substantive discussions on the latest news and research in applied cryptography.

Beschreibung

vor 4 Jahren
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 Ducas , a
tenured researcher at CWI, Amsterdam who specialises in
lattice-based cryptography, to help us understand where Schnorr was
coming from, whether his results stand on their own, and how the
influence of lattice mathematics in applied cryptography has grown
over the past decade. Links and papers discussed in the show: *
Schnorr's ePrint submission (https://eprint.iacr.org/2021/232) *
Leo Ducas's implementation of Schnorr's proposed algorithm in Sage
(https://github.com/lducas/SchnorrGate) Music composed by Toby Fox
and performed by Sean Schafianski
(https://seanschafianski.bandcamp.com/). Special Guest: Léo Ducas.

Kommentare (0)

Lade Inhalte...

Abonnenten

15
15