• One Pair to Rule Them All: An Optimal Algorithm for Solving Code Equivalence via Codeword Search
• Alessandro Budroni, Andre Esser
• Eprint 2026
• Syndrome Decoding with Hints
• Letizia D'Achille, Andre Esser, Nicolai Kraus
• Eprint 2026
• Rank Syndrome Decoding Estimator - An Asymptotic and Concrete Analysis
• Andre Esser, Javier Verbel, Ricardo Villanueva-Polanco
• Eprint 2026
• Two Is All It Takes: Asymptotic and Concrete Improvements for Solving Code Equivalence
• Alessandro Budroni, Andre Esser, Ermes Franch, Andrea Natale
• PKC 2026
• Sneaking up the Ranks: Partial Key Exposure Attacks on Rank-Based Schemes
• Giuseppe D'Alconzo, Andre Esser, Andrea Gangemi, Carlo Sanna
• Designs, Codes & Cryptography 2026
• LESS is Even More: Optimizing Digital Signatures from Code Equivalence
• Luke Beckwith, Andre Esser, Edoardo Persichetti, Paolo Santini, Floyd Zweydinger
• TCHES 2025
• Memory-Efficient Attacks on Small LWE Keys (Extended Version)
• Andre Esser, Arindam Mukherjee, Santanu Sarkar
• Journal of Cryptology 2024
• Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks
• Andre Esser, Paolo Santini
• CRYPTO 2024
• Asymptotics and Improvements of Sieving for Codes
• Léo Ducas, Andre Esser, Simona Etinski and Elena Kirshanova
• EUROCRYPT 2024
• PERK: compact signature scheme based on a new variant of the permuted kernel problem
• Slim Bettaieb, Loïc Bidoux, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni and Marco Palumbi
• Designs, Codes & Cryptography 2024
• MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head
• Adj et al.
• TCHES 2024
• CryptographicEstimators: a Software Library for Cryptographic Hardness Estimation
• Andre Esser, Javier Verbel, Floyd Zweydinger, Emanuele Bellini
• ASIACCS 2024
• Memory-Efficient Attacks on Small LWE Keys
• Andre Esser, Rahul Girme, Arindam Mukherjee, Santanu Sarkar
• ASIACRYPT 2023
• Low Memory Attacks on Small Key CSIDH
• Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May
• ACNS 2023
• New Time-Memory Trade-Offs for Subset Sum -- Improving ISD in Theory and Practice
• Andre Esser, Floyd Zweydinger
• EUROCRYPT 2023
• Revisiting Nearest-Neighbor-Based Information Set Decoding
• Andre Esser
• IMACC 2023
• Parallel Isogeny Path Finding with Limited Memory
• Emanuele Bellini et al.
• INDOCRYPT 2022
• MR-DSS – Smaller MinRank-based (Ring-)Signatures
• Emanuele Bellini, Andre Esser, Carlo Sanna, Javier Verbel
• PQCrypto 2022
• Hybrid Decoding – Classical-Quantum Trade-Offs for Information Set Decoding
• Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José Ignacio Latorre, Marc Manzano
• PQCrypto 2022
• Partial Key Exposure Attacks on BIKE, Rainbow and NTRU
• Andre Esser, Alexander May, Javier Verbel, Weiqiang Wen
• CRYPTO 2022
• McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD
• Andre Esser, Alexander May, Floyd Zweydinger
• EUROCRYPT 2022
• Syndrome Decoding Estimator
• Andre Esser, Emanuele Bellini
• PKC 2022
• A Faster Algorithm for Finding Closest Pairs in Hamming Metric
• Andre Esser, Robert Kuebler, Floyd Zweydinger
• FSTTCS 2021
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources
• Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano
• EPRINT 2021
• Memory-efficient Algorithms for Solving Subset Sum and related Problems with Cryptanalytic Applications
• Andre Esser
• PhD thesis - Ruhr University Bochum
• Low Weight Discrete Logarithm and Subset Sum in 2^(0.65n) with Polynomial Memory.
• Andre Esser, Alexander May
• EUROCRYPT 2020
• Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
• Claire Delaplace, Andre Esser, Alexander May
• IMACC 2019
• Dissection-BKW
• Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler
• CRYPTO 2018
• LPN Decoded
• Andre Esser, Robert Kübler, Alexander May
• CRYPTO 2017