Thomas Johansson - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real TimeMartin Hell, Thomas Johansson. joc, 24(3):427-445, 2011. [doi]

2010

A Note on Fast Algebraic Attacks and Higher Order NonlinearitiesQichun Wang, Thomas Johansson. cisc 2011: 404-414 [doi]

2009

An overview of distinguishing attacks on stream ciphersMartin Hell, Thomas Johansson, Lennart Brynielsson. ccds, 1(1):71-94, 2009. [doi]

An Efficient State Recovery Attack on X-FCSR-256Paul Stankovski, Martin Hell, Thomas Johansson. fse 2009: 23-37 [doi]

Improving the Rainbow Attack by Reusing ColoursMartin Ã…gren, Thomas Johansson, Martin Hell. cans 2009: 362-378 [doi]

2008

Breaking the F-FCSR-H Stream Cipher in Real TimeMartin Hell, Thomas Johansson. asiacrypt 2008: 557-569 [doi]

The Grain Family of Stream CiphersMartin Hell, Thomas Johansson, Alexander Maximov, Willi Meier. In Matthew J. B. Robshaw, Olivier Billet, editors, New Stream Cipher Designs - The eSTREAM Finalists. Volume 4986 of Lecture Notes in Computer Science, pages 179-190, Springer, 2008. [doi]

2007

2006

2005

2004

Correlation Attacks Using a New Class of Weak Feedback PolynomialsHåkan Englund, Martin Hell, Thomas Johansson. fse 2004: 127-142 [doi]

A New Simple Technique to Attack Filter Generators and Related CiphersHåkan Englund, Thomas Johansson. sacrypt 2004: 39-53 [doi]

An Improved Correlation Attack on A5/1Alexander Maximov, Thomas Johansson, Steve Babbage. sacrypt 2004: 1-18 [doi]

2003

Another attack on A5/1Patrik Ekdahl, Thomas Johansson. TIT, 49(1):284-289, 2003.

Predicting the Shrinking Generator with Fixed ConnectionsPatrik Ekdahl, Willi Meier, Thomas Johansson. eurocrypt 2003: 330-344 [doi]

Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, ProceedingsThomas Johansson, Subhamoy Maitra, editors, Volume 2904 of Lecture Notes in Computer Science, Springer, 2003.

Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised PapersThomas Johansson, editor, Volume 2887 of Lecture Notes in Computer Science, Springer, 2003.

A construction of resilient functions with high nonlinearityThomas Johansson, Enes Pasalic. TIT, 49(2):494-501, 2003.

Analysis and Design of Modern Stream Ciphers: (Invited Paper) pThomas Johansson. ima 2003: 66 [doi]

2002

2001

Almost k-Wise Independent Sample Spaces and Their Cryptologic ApplicationsKaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. joc, 14(4):231-253, 2001. [doi]

New Constructions of Resilient and Correlation Immune Boolean Functions Achieving Upper Bound on NonlinearityEmir Pasalic, Subhamoy Maitra, Thomas Johansson, Palash Sarkar. endm, 6:158-167, 2001. [doi]

2000

A Simple Algorithm for Fast Correlation Attacks on Stream CiphersVladimor V. Chepyzhov, Thomas Johansson, Ben J. M. Smeets. fse 2001: 181-195 [doi]

Fast Correlation Attacks through Reconstruction of Linear PolynomialsThomas Johansson, Fredrik Jönsson. crypto 2000: 300-315 [doi]

1999

Further Results on Asymmetric Authentication SchemesThomas Johansson. iandc, 151(1-2):100-133, 1999.

Improved Fast Correlation Attacks on Stream Ciphers via Convolutional CodesThomas Johansson, Fredrik Jönsson. eurocrypt 1999: 347-362 [doi]

Fast Correlation Attacks Based on Turbo Code TechniquesThomas Johansson, Fredrik Jönsson. crypto 1999: 181-197 [doi]

Further Results on the Relation Between Nonlinearity and Resiliency for Boolean FunctionsEnes Pasalic, Thomas Johansson. ima 1999: 35-44 [doi]

1998

Reduced Complexity Correlation Attacks on Two Clock-Controlled GeneratorsThomas Johansson. asiacrypt 1998: 342-356 [doi]

A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block CodesThomas Johansson, Kamil Sh. Zigangirov. TIT, 44(7):3124-3129, 1998.

1997

Bucket Hashing with a Small Key SizeThomas Johansson. eurocrypt 1997: 149-162 [doi]

Almost k-wise Independent Sample Spaces and Their Cryptologic ApplicationsKaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. eurocrypt 1997: 409-421 [doi]

1996

Universal Hash Functions from Exponential Sums over Finite Fields and Galois RingsTor Helleseth, Thomas Johansson. crypto 1996: 31-44 [doi]

On the cardinality of systematic authentication codes via error-correcting codesGregory Kabatianskii, Ben J. M. Smeets, Thomas Johansson. TIT, 42(2):566-578, 1996.

1995

Authentication Codes for Nontrusting Parties Obtained from Rank Metric CodesThomas Johansson. dcc, 6(3):205-218, 1995.

1994

Underground Capacitors Very Efficient Decoupling for High Performance UHF Signal Processing ICsThomas Johansson, L. R. Virtanen, J. M. Gobbi. eurodac 1994: 655

A New Parallel MIMD Connected Component Labeling AlgorithmThomas Johansson, Ewert Bengtsson. parle 1994: 801-804

On A²-Codes Including Arbiter s AttacksThomas Johansson, Ben J. M. Smeets. eurocrypt 1994: 456-460 [doi]

A Shift Register Construction of Unconditionally Secure Authentication CodesThomas Johansson. dcc, 4(1):69-81, 1994.

1993

On Families of Hash Functions via Geometric Codes and ConcatenationJürgen Bierbrauer, Thomas Johansson, Gregory Kabatianskii, Ben J. M. Smeets. crypto 1994: 331-342 [doi]

On the Construction of Perfect Authentication Codes that Permit ArbitrationThomas Johansson. crypto 1994: 343-354 [doi]

On the Relation between A-Codes and Codes Correcting Independent ErrorsThomas Johansson, Gregory Kabatianskii, Ben J. M. Smeets. eurocrypt 1993: 1-11 [doi]