Fredrik Jönsson

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.

VLDB 2026 Research / reviewers in the wild / expert

dblp:34/4627 · DBLP profile ↗

← Back

6ranked-venue papers

1as first author

0since 2021 · last 2002

0000-0001-7589-1723ORCID · corroborated

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

Security and privacy · 3Theory of computation · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 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 5 papers		Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science 3 papers		Coding theory · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis correlation attack	0.1	4	2002	Theoretical analysis of a correlation attack based on convolutional codes · IEEE Trans. Inf. Theory 2002 Fast Correlation Attacks through Reconstruction of Linear Polynomials · CRYPTO 2000 Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes · EUROCRYPT 1999
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis fast correlation attack	0.1	2	2000	Fast Correlation Attacks through Reconstruction of Linear Polynomials · CRYPTO 2000 Fast Correlation Attacks Based on Turbo Code Techniques · CRYPTO 1999
Cryptographic primitives and cryptanalysis stream cipher cryptanalysis	0.1	2	2000	Fast Correlation Attacks through Reconstruction of Linear Polynomials · CRYPTO 2000 Fast Correlation Attacks Based on Turbo Code Techniques · CRYPTO 1999
Cryptographic primitives and cryptanalysis › post-quantum cryptography code-based cryptography	0.0	1	2002	On the complexity of some cryptographic problems based on the general decoding problem · IEEE Trans. Inf. Theory 2002
Cryptographic primitives and cryptanalysis › coding theory information set decoding	0.0	1	2002	On the complexity of some cryptographic problems based on the general decoding problem · IEEE Trans. Inf. Theory 2002
Cryptographic primitives and cryptanalysis stream cipher	0.0	1	2002	Theoretical analysis of a correlation attack based on convolutional codes · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes › decoding decoding algorithms	0.0	1	2002	On the complexity of some cryptographic problems based on the general decoding problem · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes › decoding › decoding algorithms probabilistic decoding	0.0	1	2002	On the complexity of some cryptographic problems based on the general decoding problem · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes convolutional codes	0.0	2	2002	Theoretical analysis of a correlation attack based on convolutional codes · IEEE Trans. Inf. Theory 2002 Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes · EUROCRYPT 1999
Coding theory › channel coding › error probability bounds random coding bound	0.0	1	2002	Theoretical analysis of a correlation attack based on convolutional codes · IEEE Trans. Inf. Theory 2002

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

simulation · 0.1probabilistic algorithm · 0.1maximum-likelihood decoding · 0.0maximum likelihood decoding · 0.0linear polynomial reconstruction · 0.0turbo code techniques · 0.0

Year	Publication	Venue	Position
2002	A fast correlation attack on LILI-128 Fredrik Jönsson, Thomas Johansson 0001	Inf. Process. Lett.	1
2002	Theoretical analysis of a correlation attack based on convolutional codes abstract One general class of attacks on stream ciphers is correlation attacks. Most of previous results regarding performance of correlation attacks have been based entirely on simulations. We use random coding bounds for convolutional codes to give a theoretical analysis of a previously proposed correlation attack based on convolutional codes. The results from the theoretical derivation are verified by simulations. Thomas Johansson 0001, Fredrik Jönsson	IEEE Trans. Inf. Theory	2
2002	On the complexity of some cryptographic problems based on the general decoding problem abstract A new probabilistic algorithm for decoding one received word from a set of many given received words, into a codeword such that the Hamming distance between the received word and the codeword is at most t, is proposed. The new algorithm is applicable to several cryptographic problems, such as the Stern (1989, 1994) identification scheme, the McEliece (1978) public-key cryptosystem, and in correlation attacks on stream ciphers. When applicable, it runs significantly faster than previous algorithms used for attacks on these cryptosystems. Thomas Johansson 0001, Fredrik Jönsson	IEEE Trans. Inf. Theory	2
2000	Fast Correlation Attacks through Reconstruction of Linear Polynomials Thomas Johansson 0001, Fredrik Jönsson	CRYPTO	2
1999	Fast Correlation Attacks Based on Turbo Code Techniques Thomas Johansson 0001, Fredrik Jönsson	CRYPTO	2
1999	Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes Thomas Johansson 0001, Fredrik Jönsson	EUROCRYPT	2