Andre Esser

Orcid: 0000-0001-5806-3600

Affiliations:
  • Technology Innovation Institute, Cryptography Research Center, Abu Dhabi, UAE
  • Ruhr University Bochum, Horst Görtz Institute for IT Security, Germany (former, PhD 2020)


According to our database1, Andre Esser authored at least 26 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Memory-Efficient Attacks on Small LWE Keys.
J. Cryptol., December, 2024

PERK: compact signature scheme based on a new variant of the permuted kernel problem.
Des. Codes Cryptogr., August, 2024

MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation.
Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

2023
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation.
IACR Cryptol. ePrint Arch., 2023

Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks.
IACR Cryptol. ePrint Arch., 2023

Memory-Efficient Attacks on Small LWE Keys.
IACR Cryptol. ePrint Arch., 2023

Asymptotics and Improvements of Sieving for Codes.
IACR Cryptol. ePrint Arch., 2023

Low Memory Attacks on Small Key CSIDH.
IACR Cryptol. ePrint Arch., 2023

2022
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice.
IACR Cryptol. ePrint Arch., 2022

Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding.
IACR Cryptol. ePrint Arch., 2022

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU.
IACR Cryptol. ePrint Arch., 2022

Revisiting Nearest-Neighbor-Based Information Set Decoding.
IACR Cryptol. ePrint Arch., 2022

Parallel Isogeny Path Finding with Limited Memory.
IACR Cryptol. ePrint Arch., 2022

MR-DSS - Smaller MinRank-based (Ring-)Signatures.
IACR Cryptol. ePrint Arch., 2022

2021
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources.
IACR Cryptol. ePrint Arch., 2021

McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD.
IACR Cryptol. ePrint Arch., 2021

Syndrome Decoding Estimator.
IACR Cryptol. ePrint Arch., 2021

A Faster Algorithm for Finding Closest Pairs in Hamming Metric.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications.
PhD thesis, 2020

Low Weight Discrete Logarithm and Subset Sum in 2<sup>0.65n</sup> with Polynomial Memory.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Low Weight Discrete Logarithms and Subset Sum in 2<sup>0.65n</sup> with Polynomial Memory.
IACR Cryptol. ePrint Arch., 2019

Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions.
IACR Cryptol. ePrint Arch., 2019

2018
Dissection-BKW.
IACR Cryptol. ePrint Arch., 2018

Wi-Fi Network Testing Using an Integrated Evil-Twin Framework.
Proceedings of the 2018 Fifth International Conference on Internet of Things: Systems, 2018

2017
LPN Decoded.
IACR Cryptol. ePrint Arch., 2017


  Loading...