John Erik Mathiassen

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:09/1461 · DBLP profile ↗

← Back

7ranked-venue papers

0as first author

0since 2021 · last 2010

—ORCID · none

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

Security and privacy · 5Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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 1 paper		Cryptographic primitives and cryptanalysis · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis hash function cryptanalysis	0.1	1	2010	Cryptanalysis of MD2 · J. Cryptol. 2010
Coding theory › sequences linear complexity	0.0	1	2004	Linear complexity over Fp of Sidel'nikov sequences · IEEE Trans. Inf. Theory 2004
Coding theory sequences	0.0	1	2004	Linear complexity over Fp of Sidel'nikov sequences · IEEE Trans. Inf. Theory 2004
Coding theory › sequences › sequence design › low-correlation sequence sidel'nikov sequence	0.0	1	2004	Linear complexity over Fp of Sidel'nikov sequences · IEEE Trans. Inf. Theory 2004

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

cryptanalysis · 0.1

Year	Publication	Venue	Position
2010	Cryptanalysis of MD2 Lars R. Knudsen, John Erik Mathiassen, Frédéric Muller, Søren S. Thomsen	J. Cryptol.	2
2005	Preimage and Collision Attacks on MD2 Lars R. Knudsen, John Erik Mathiassen	FSE	2
2004	On the Role of Key Schedules in Attacks on Iterated Ciphers Lars R. Knudsen, John Erik Mathiassen	ESORICS	2
2004	Linear complexity over Fp of Sidel'nikov sequences abstract Helleseth, Kim and No (2003) described the linear complexity over F/sub p/ of Sidel'nikov sequences of length p/sup m/ -1 for p = 3, 5 and 7. This result is generalized to all odd primes. Tor Helleseth, John Erik Mathiassen, Martijn Maas, Toon Segers	ISIT	2
2004	Linear complexity over Fp of Sidel'nikov sequences abstract Helleseth, Kim, and No (2003) described the linear complexity over F/sub p/ of Sidel'nikov sequences of length p/sup m/-1 for p=3, 5, and 7. In this correspondence, the result is generalized to all odd primes. Tor Helleseth, Martijn Maas, John Erik Mathiassen, Toon Segers	IEEE Trans. Inf. Theory	3
2003	Improved Fast Correlation Attack Using Low Rate Codes Håvard Molland, John Erik Mathiassen, Tor Helleseth	IMACC	2
2000	A Chosen-Plaintext Linear Attack on DES Lars R. Knudsen, John Erik Mathiassen	FSE	2