Enrico Thomae

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:32/10243 · DBLP profile ↗

← Back

4ranked-venue papers

1as first author

0since 2021 · last 2012

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 1 first-author

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 1 paper		Coding theory · 100%
Network and information security 3 papers		Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Embedded and real-time systems · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis post-quantum cryptography	0.1	1	2012	Efficient Implementations of MQPKS on Constrained Devices · CHES 2012
Cryptographic primitives and cryptanalysis public-key cryptography	0.1	1	2011	Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems · CHES 2011
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
Embedded and real-time systems › resource-constrained systems resource-constrained devices	0.0	1	2012	Efficient Implementations of MQPKS on Constrained Devices · CHES 2012
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

Methods — techniques the papers use, named apart from their topics

information set decoding · 0.2multivariate quadratic signatures · 0.1

Year	Publication	Venue	Position
2012	Efficient Implementations of MQPKS on Constrained Devices Peter Czypek, Stefan Heyse, Enrico Thomae	CHES	3
2011	Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ Alexander May 0001, Alexander Meurer, Enrico Thomae	ASIACRYPT	3
2011	Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems Albrecht Petzoldt, Enrico Thomae, Stanislav Bulygin, Christopher Wolf	CHES	2
2011	Roots of Square: Cryptanalysis of Double-Layer Square and Square+ Enrico Thomae, Christopher Wolf	PQCrypto	1