LPN Decoded. - Andre Esser 001; Robert Kübler; Alexander May 001 (IACR Cryptol. ePrint Arch., 2017)

Wi-Fi Network Testing Using an Integrated Evil-Twin Framework. - Andre Esser 001; Carlos Serrão (IoTSMS, 2018)

Dissection-BKW. - Andre Esser 001; Felix Heuer; Robert Kübler; Alexander May 001; Christian Sohler (IACR Cryptol. ePrint Arch., 2018)

Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. - Claire Delaplace; Andre Esser 001; Alexander May 001 (IACR Cryptol. ePrint Arch., 2019)

Low Weight Discrete Logarithms and Subset Sum in 20.65n with Polynomial Memory. - Andre Esser 001; Alexander May 001 (IACR Cryptol. ePrint Arch., 2019)

Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory. - Andre Esser 001; Alexander May 001 (EUROCRYPT (3), 2020)

Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications. - Andre Esser 001 (2020)

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

Syndrome Decoding Estimator. - Andre Esser 001; Emanuele Bellini 002 (IACR Cryptol. ePrint Arch., 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)

An Optimized Quantum Implementation of ISD on Scalable Quantum Resources. - Andre Esser 001; Sergi Ramos-Calderer; Emanuele Bellini 002; José I. Latorre; Marc Manzano (IACR Cryptol. ePrint Arch., 2021)

MR-DSS - Smaller MinRank-based (Ring-)Signatures. - Emanuele Bellini 002; Andre Esser 001; Carlo Sanna; Javier A. Verbel (IACR Cryptol. ePrint Arch., 2022)

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)

Revisiting Nearest-Neighbor-Based Information Set Decoding. - Andre Esser 001 (IACR Cryptol. ePrint Arch., 2022)

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. - Andre Esser 001; Alexander May 001; Javier A. Verbel; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2022)

Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding. - Andre Esser 001; Sergi Ramos-Calderer; Emanuele Bellini 002; José Ignacio Latorre; Marc Manzano (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)

Low Memory Attacks on Small Key CSIDH. - Jesús-Javier Chi-Domínguez; Andre Esser 001; Sabrina Kunzweiler; Alexander May 001 (IACR Cryptol. ePrint Arch., 2023)

Asymptotics and Improvements of Sieving for Codes. - Léo Ducas; Andre Esser 001; Simona Etinski; Elena Kirshanova (IACR Cryptol. ePrint Arch., 2023)

Memory-Efficient Attacks on Small LWE Keys. - Andre Esser 001; Rahul Girme; Arindam Mukherjee 003; Santanu Sarkar 001 (IACR Cryptol. ePrint Arch., 2023)

Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks. - Andre Esser 001; Paolo Santini (IACR Cryptol. ePrint Arch., 2023)

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)

Sneaking up the Ranks: Partial Key Exposure Attacks on Rank-Based Schemes. - Giuseppe D'Alconzo; Andre Esser 001; Andrea Gangemi; Carlo Sanna (IACR Cryptol. ePrint Arch., 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)

PERK: compact signature scheme based on a new variant of the permuted kernel problem. - Slim Bettaieb; Loïc Bidoux; Victor Dyseryn; Andre Esser 001; Philippe Gaborit; Mukul Kulkarni; Marco Palumbi (Des. Codes Cryptogr., 2024)

Memory-Efficient Attacks on Small LWE Keys. - Andre Esser 001; Arindam Mukherjee 003; Santanu Sarkar 001 (J. Cryptol., 2024)

LESS is Even More: Optimizing Digital Signatures from Code Equivalence. - Luke Beckwith; Andre Esser 001; Edoardo Persichetti; Paolo Santini; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2025)

Two Is All It Takes: Asymptotic and Concrete Improvements for Solving Code Equivalence. - Alessandro Budroni; Andre Esser 001; Ermes Franch; Andrea Natale (IACR Cryptol. ePrint Arch., 2025)