A Faster Algorithm for Finding Closest Pairs in Hamming Metric. - Andre Esser 001; Robert Kübler; Floyd Zweydinger (FSTTCS, 2021)

McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. - Andre Esser 001; Alexander May 001; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2021)

Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. - Alexander May 001; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2021)

Parallel Isogeny Path Finding with Limited Memory. - Emanuele Bellini 002; Jorge Chávez-Saab; Jesús-Javier Chi-Domínguez; Andre Esser 001; Sorina Ionica; Luis Rivera-Zamarripa; Francisco Rodríguez-Henríquez; Monika Trimoska; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2022)

New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. - Andre Esser 001; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2022)

ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. - Andre Esser 001; Javier A. Verbel; Floyd Zweydinger; Emanuele Bellini 002 (IACR Cryptol. ePrint Arch., 2023)

SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. - Andre Esser 001; Javier A. Verbel; Floyd Zweydinger; Emanuele Bellini 002 (AsiaCCS, 2024)

MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. - Gora Adj; Stefano Barbero; Emanuele Bellini 002; Andre Esser 001; Luis Rivera-Zamarripa; Carlo Sanna; Javier A. Verbel; Floyd Zweydinger (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024)

Practical cryptanalysis of code-based crypto schemes - Floyd Zweydinger (2024)