Thomas Wunderer

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 SIGIR 2026 / reviewers in the wild / expert

dblp:165/8383 · DBLP profile ↗

← Back

4ranked-venue papers

0as first author

0since 2021 · last 2019

—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.

Network and information security

1 paper

Cryptographic primitives and cryptanalysis · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography lattice-based cryptography	0.3	1	2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE · ASIACRYPT (1) 2017
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography lattice reduction	0.3	1	2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE · ASIACRYPT (1) 2017
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography learning with errors	0.3	1	2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE · ASIACRYPT (1) 2017
Cryptographic primitives and cryptanalysis post-quantum cryptography	0.3	1	2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE · ASIACRYPT (1) 2017
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography › lattice problems unique shortest vector problem	0.3	1	2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE · ASIACRYPT (1) 2017

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

lattice reduction · 0.3

Year	Publication	Venue	Position
2019	Exploring Trade-offs in Batch Bounded Distance Decoding Martin R. Albrecht, Benjamin R. Curtis, Thomas Wunderer	SAC	3
2018	Revisiting the Sparsification Technique in Kannan's Embedding Attack on LWE Yuntao Wang 0002, Thomas Wunderer	ISPEC	2
2017	Revisiting the Expected Cost of Solving uSVP and Applications to LWE Martin R. Albrecht, Florian Göpfert, Fernando Virdia, Thomas Wunderer	ASIACRYPT (1)	4
2017	A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE Florian Göpfert, Christine van Vredendaal, Thomas Wunderer	PQCrypto	3