Håvard Molland

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:33/2179 · DBLP profile ↗

← Back

5ranked-venue papers

5as first author

0since 2021 · last 2006

—ORCID · none

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

Security and privacy · 3 · 3 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Network and information security

2 papers

Cryptographic primitives and cryptanalysis · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis stream cipher	0.1	2	2006	Linear Properties in T-Functions · IEEE Trans. Inf. Theory 2006 An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators · CRYPTO 2004
Cryptographic primitives and cryptanalysis linear cryptanalysis	0.1	1	2006	Linear Properties in T-Functions · IEEE Trans. Inf. Theory 2006
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis correlation attack	0.0	1	2004	An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators · CRYPTO 2004

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

linear equation analysis · 0.1

Year	Publication	Venue	Position
2006	Linear Properties in T-Functions abstract Linear equations have always been powerful tools in cryptanalysis. In this correspondence, we present a general linear equation of minimum weight 3 in F2that holds for all state lengths n and all shifts i of sequences generated by the T-function xi=xi-12orC+xi-1mod 2nproposed by Klimov and Shamir. It is surprising that these linear properties exist, and they indicate that the sequences generated by the T-functions have more structures than claimed by Klimov and Shamir Håvard Molland, Tor Helleseth	IEEE Trans. Inf. Theory	1
2005	Alinear weakness in the Klimov-Shamir T-function abstract Linear equations have always been powerful tools in cryptanalysis. In this paper, we present a general linear equation in the binary alphabet of minimum weight 3 that holds for all state lengths and all shifts of sequences generated by the T-function proposed by Klimov and Shamir. It is surprising that these linear properties exist, and they indicate that the T-functions are not as 'wild' and non-algebraic as claimed by Klimov and Shamir. We also use the equation to propose a simple algebraic attack on cryptographic T-functions Håvard Molland, Tor Helleseth	ISIT	1
2004	An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators Håvard Molland, Tor Helleseth	CRYPTO	1
2004	Improved Linear Consistency Attack on Irregular Clocked Keystream Generators Håvard Molland	FSE	1
2003	Improved Fast Correlation Attack Using Low Rate Codes Håvard Molland, John Erik Mathiassen, Tor Helleseth	IMACC	1