EDBT 2026 Demo / reviewers in the wild / expert
Alexander Meurer
dblp:45/8341
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Coding theory · 100% | |
| Network and information security
3 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › coding theory
information set decoding |
0.1 | 1 | 2012 | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding · EUROCRYPT 2012 |
Coding theory › error-correcting codes › decoding
decoding algorithms |
0.1 | 1 | 2011 | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ · ASIACRYPT 2011 |
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
information set decoding |
0.1 | 1 | 2011 | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ · ASIACRYPT 2011 |
Coding theory › error-correcting codes › block codes › linear code
random linear codes |
0.1 | 1 | 2011 | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ · ASIACRYPT 2011 |
Cryptographic primitives and cryptanalysis › cryptanalysis
key recovery attack |
0.1 | 1 | 2010 | Correcting Errors in RSA Private Keys · CRYPTO 2010 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.1 | 1 | 2010 | Correcting Errors in RSA Private Keys · CRYPTO 2010 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based cryptography |
0.0 | 1 | 2011 | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ · ASIACRYPT 2011 |
Coding theory
error-correcting codes |
0.0 | 1 | 2010 | Correcting Errors in RSA Private Keys · CRYPTO 2010 |
Methods — techniques the papers use, named apart from their topics
information set decoding · 0.4error correction · 0.2coppersmith's method · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Quantum Algorithms for the Subset-Sum Problem
Daniel J. Bernstein, Stacey Jeffery, Tanja Lange 0001, Alexander Meurer |
PQCrypto | 4 |
| 2012 | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Anja Becker 0001, Antoine Joux, Alexander May 0001, Alexander Meurer |
EUROCRYPT | 4 |
| 2011 | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
Alexander May 0001, Alexander Meurer, Enrico Thomae |
ASIACRYPT | 2 |
| 2010 | Correcting Errors in RSA Private Keys
Wilko Henecka, Alexander May 0001, Alexander Meurer |
CRYPTO | 3 |