default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndre Esser 0001
Person information
- affiliation: Technology Innovation Institute, Cryptography Research Center, Abu Dhabi, UAE
- affiliation (former, PhD 2020): Ruhr University Bochum, Horst Görtz Institute for IT Security, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Slim Bettaieb, Loïc Bidoux
, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni, Marco Palumbi:
PERK: compact signature scheme based on a new variant of the permuted kernel problem. Des. Codes Cryptogr. 92(8): 2131-2157 (2024)- [j2]Andre Esser, Arindam Mukherjee, Santanu Sarkar:
Memory-Efficient Attacks on Small LWE Keys. J. Cryptol. 37(4): 36 (2024) - [j1]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2): 304-328 (2024) - [c19]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. AsiaCCS 2024 - [c18]Andre Esser, Paolo Santini:
Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks. CRYPTO (6) 2024: 183-217 - [c17]Léo Ducas, Andre Esser, Simona Etinski, Elena Kirshanova:
Asymptotics and Improvements of Sieving for Codes. EUROCRYPT (6) 2024: 151-180 - [i23]Slim Bettaieb, Loïc Bidoux, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni, Marco Palumbi:
PERK: Compact Signature Scheme Based on a New Variant of the Permuted Kernel Problem. IACR Cryptol. ePrint Arch. 2024: 748 (2024) - [i22]Giuseppe D'Alconzo, Andre Esser, Andrea Gangemi, Carlo Sanna:
Sneaking up the Ranks: Partial Key Exposure Attacks on Rank-Based Schemes. IACR Cryptol. ePrint Arch. 2024: 2070 (2024) - 2023
- [c16]Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May:
Low Memory Attacks on Small Key CSIDH. ACNS 2023: 276-304 - [c15]Andre Esser, Rahul Girme, Arindam Mukherjee, Santanu Sarkar:
Memory-Efficient Attacks on Small LWE Keys. ASIACRYPT (4) 2023: 72-105 - [c14]Andre Esser, Floyd Zweydinger:
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. EUROCRYPT (5) 2023: 360-390 - [c13]Andre Esser:
Revisiting Nearest-Neighbor-Based Information Set Decoding. IMACC 2023: 34-54 - [e1]Andre Esser, Paolo Santini:
Code-Based Cryptography - 11th International Workshop, CBCrypto 2023, Lyon, France, April 22-23, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14311, Springer 2023, ISBN 978-3-031-46494-2 [contents] - [i21]Andre Esser, Rahul Girme, Arindam Mukherjee, Santanu Sarkar:
Memory-Efficient Attacks on Small LWE Keys. IACR Cryptol. ePrint Arch. 2023: 243 (2023) - [i20]Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May:
Low Memory Attacks on Small Key CSIDH. IACR Cryptol. ePrint Arch. 2023: 507 (2023) - [i19]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. IACR Cryptol. ePrint Arch. 2023: 589 (2023) - [i18]Andre Esser, Paolo Santini:
Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks. IACR Cryptol. ePrint Arch. 2023: 1568 (2023) - [i17]Léo Ducas, Andre Esser, Simona Etinski, Elena Kirshanova:
Asymptotics and Improvements of Sieving for Codes. IACR Cryptol. ePrint Arch. 2023: 1577 (2023) - [i16]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Cryptol. ePrint Arch. 2023: 1666 (2023) - 2022
- [c12]Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. CRYPTO (3) 2022: 346-375 - [c11]Andre Esser, Alexander May, Floyd Zweydinger:
McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. EUROCRYPT (3) 2022: 433-457 - [c10]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. INDOCRYPT 2022: 294-316 - [c9]Andre Esser, Emanuele Bellini:
Syndrome Decoding Estimator. Public Key Cryptography (1) 2022: 112-141 - [c8]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding. PQCrypto 2022: 3-23 - [c7]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-Based (Ring-)Signatures. PQCrypto 2022: 144-169 - [i15]Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. IACR Cryptol. ePrint Arch. 2022: 259 (2022) - [i14]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José Ignacio Latorre, Marc Manzano:
Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding. IACR Cryptol. ePrint Arch. 2022: 964 (2022) - [i13]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-based (Ring-)Signatures. IACR Cryptol. ePrint Arch. 2022: 973 (2022) - [i12]Andre Esser:
Revisiting Nearest-Neighbor-Based Information Set Decoding. IACR Cryptol. ePrint Arch. 2022: 1328 (2022) - [i11]Andre Esser, Floyd Zweydinger:
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. IACR Cryptol. ePrint Arch. 2022: 1329 (2022) - [i10]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. IACR Cryptol. ePrint Arch. 2022: 1464 (2022) - 2021
- [c6]Andre Esser, Robert Kübler, Floyd Zweydinger:
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. FSTTCS 2021: 20:1-20:21 - [i9]Andre Esser, Robert Kübler, Floyd Zweydinger:
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. CoRR abs/2102.02597 (2021) - [i8]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources. CoRR abs/2112.06157 (2021) - [i7]Andre Esser, Emanuele Bellini:
Syndrome Decoding Estimator. IACR Cryptol. ePrint Arch. 2021: 1243 (2021) - [i6]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources. IACR Cryptol. ePrint Arch. 2021: 1608 (2021) - [i5]Andre Esser, Alexander May, Floyd Zweydinger:
McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. IACR Cryptol. ePrint Arch. 2021: 1634 (2021) - 2020
- [b1]Andre Esser:
Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications. Ruhr University Bochum, Germany, 2020 - [c5]Andre Esser, Alexander May:
Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory. EUROCRYPT (3) 2020: 94-122
2010 – 2019
- 2019
- [c4]Claire Delaplace, Andre Esser, Alexander May:
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IMACC 2019: 178-199 - [i4]Claire Delaplace, Andre Esser, Alexander May:
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IACR Cryptol. ePrint Arch. 2019: 804 (2019) - [i3]Andre Esser, Alexander May:
Low Weight Discrete Logarithms and Subset Sum in 20.65n with Polynomial Memory. IACR Cryptol. ePrint Arch. 2019: 931 (2019) - 2018
- [c3]Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler:
Dissection-BKW. CRYPTO (2) 2018: 638-666 - [c2]Andre Esser, Carlos Serrão:
Wi-Fi Network Testing Using an Integrated Evil-Twin Framework. IoTSMS 2018: 216-221 - [i2]Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler:
Dissection-BKW. IACR Cryptol. ePrint Arch. 2018: 569 (2018) - 2017
- [c1]Andre Esser, Robert Kübler, Alexander May:
LPN Decoded. CRYPTO (2) 2017: 486-514 - [i1]Andre Esser, Robert Kübler, Alexander May:
LPN Decoded. IACR Cryptol. ePrint Arch. 2017: 78 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
