2 citations · 2 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2025★ 2 cited
Predicting Module-Lattice Reduction
Léo Ducas, Lynn Engelberts, Paola de Perthuis
Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as 'Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as…
cs.CR2025
Wagner's Algorithm Provably Runs in Subexponential Time for SIS
Léo Ducas, Lynn Engelberts, Johanna Loyer
At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LW…