Search the dblp DataBase
Thomas Johansson :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Thomas Johansson Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 1998, pp:342-356 [Conf ] Alexander Maximov , Thomas Johansson Fast Computation of Large Distributions and Its Cryptographic Applications. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2005, pp:313-332 [Conf ] Jürgen Bierbrauer , Thomas Johansson , Gregory Kabatianskii , Ben J. M. Smeets On Families of Hash Functions via Geometric Codes and Concatenation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1993, pp:331-342 [Conf ] Tor Helleseth , Thomas Johansson Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1996, pp:31-44 [Conf ] Thomas Johansson On the Construction of Perfect Authentication Codes that Permit Arbitration. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1993, pp:343-354 [Conf ] Thomas Johansson , Fredrik Jönsson Fast Correlation Attacks through Reconstruction of Linear Polynomials. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2000, pp:300-315 [Conf ] Thomas Johansson , Fredrik Jönsson Fast Correlation Attacks Based on Turbo Code Techniques. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1999, pp:181-197 [Conf ] Patrik Ekdahl , Willi Meier , Thomas Johansson Predicting the Shrinking Generator with Fixed Connections. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2003, pp:330-344 [Conf ] Thomas Johansson Bucket Hashing with a Small Key Size. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:149-162 [Conf ] Thomas Johansson , Fredrik Jönsson Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1999, pp:347-362 [Conf ] Thomas Johansson , Gregory Kabatianskii , Ben J. M. Smeets On the Relation between A-Codes and Codes Correcting Independent Errors. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1993, pp:1-11 [Conf ] Thomas Johansson , Ben J. M. Smeets On A²-Codes Including Arbiter's Attacks. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1994, pp:456-460 [Conf ] Kaoru Kurosawa , Thomas Johansson , Douglas R. Stinson Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:409-421 [Conf ] Thomas Johansson , L. R. Virtanen , J. M. Gobbi ``Underground Capacitors'' Very Efficient Decoupling for High Performance UHF Signal Processing ICs. [Citation Graph (0, 0)][DBLP ] EDAC-ETC-EUROASIC, 1994, pp:655- [Conf ] Wenhai Fang , Thomas Johansson , Lambert Spaanenburg Snow 2.0 IP Core for Trusted Hardware. [Citation Graph (0, 0)][DBLP ] FPL, 2005, pp:281-286 [Conf ] Martin Hell , Thomas Johansson Some Attacks on the Bit-Search Generator. [Citation Graph (0, 0)][DBLP ] FSE, 2005, pp:215-227 [Conf ] Patrik Ekdahl , Thomas Johansson Distinguishing Attacks on SOBER-t16 and t32. [Citation Graph (0, 0)][DBLP ] FSE, 2002, pp:210-224 [Conf ] Håkan Englund , Martin Hell , Thomas Johansson Correlation Attacks Using a New Class of Weak Feedback Polynomials. [Citation Graph (0, 0)][DBLP ] FSE, 2004, pp:127-142 [Conf ] Håkan Englund , Thomas Johansson A New Distinguisher for Clock Controlled Stream Ciphers. [Citation Graph (0, 0)][DBLP ] FSE, 2005, pp:181-195 [Conf ] Vladimor V. Chepyzhov , Thomas Johansson , Ben J. M. Smeets A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers. [Citation Graph (0, 0)][DBLP ] FSE, 2000, pp:181-195 [Conf ] Thomas Johansson , Willi Meier , Frédéric Muller Cryptanalysis of Achterbahn. [Citation Graph (0, 0)][DBLP ] FSE, 2006, pp:1-14 [Conf ] Thomas Johansson Analysis and Design of Modern Stream Ciphers: (Invited Paper) p. [Citation Graph (0, 0)][DBLP ] IMA Int. Conf., 2003, pp:66- [Conf ] Enes Pasalic , Thomas Johansson Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions. [Citation Graph (0, 0)][DBLP ] IMA Int. Conf., 1999, pp:35-44 [Conf ] Soumen Maity , Thomas Johansson Construction of Cryptographically Important Boolean Functions. [Citation Graph (0, 0)][DBLP ] INDOCRYPT, 2002, pp:234-245 [Conf ] Thomas Johansson , Ewert Bengtsson A New Parallel MIMD Connected Component Labeling Algorithm. [Citation Graph (0, 0)][DBLP ] PARLE, 1994, pp:801-804 [Conf ] Patrik Ekdahl , Thomas Johansson A New Version of the Stream Cipher SNOW. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2002, pp:47-61 [Conf ] Håkan Englund , Thomas Johansson A New Simple Technique to Attack Filter Generators and Related Ciphers. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2004, pp:39-53 [Conf ] Alexander Maximov , Thomas Johansson , Steve Babbage An Improved Correlation Attack on A5/1. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2004, pp:1-18 [Conf ] Thomas Johansson A Shift Register Construction of Unconditionally Secure Authentication Codes. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1994, v:4, n:1, pp:69-81 [Journal ] Thomas Johansson Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1995, v:6, n:3, pp:205-218 [Journal ] Thomas Johansson Further Results on Asymmetric Authentication Schemes. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1999, v:151, n:1-2, pp:100-133 [Journal ] Fredrik Jönsson , Thomas Johansson A fast correlation attack on LILI-128. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:127-132 [Journal ] Kaoru Kurosawa , Thomas Johansson , Douglas R. Stinson Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 2001, v:14, n:4, pp:231-253 [Journal ] Patrik Ekdahl , Thomas Johansson Another attack on A5/1. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:284-289 [Journal ] Thomas Johansson , Enes Pasalic A construction of resilient functions with high nonlinearity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:494-501 [Journal ] Thomas Johansson , Kamil Sh. Zigangirov A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3124-3129 [Journal ] Thomas Johansson , Fredrik Jönsson Theoretical analysis of a correlation attack based on convolutional codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2173-2181 [Journal ] Thomas Johansson , Fredrik Jönsson On the complexity of some cryptographic problems based on the general decoding problem. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:10, pp:2669-2678 [Journal ] Gregory Kabatianskii , Ben J. M. Smeets , Thomas Johansson On the cardinality of systematic authentication codes via error-correcting codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:566-578 [Journal ] Martin Hell , Thomas Johansson A Key Recovery Attack on Edon80. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2007, pp:568-581 [Conf ] Håkan Englund , Martin Hell , Thomas Johansson Two General Attacks on Pomaranch-Like Keystream Generators. [Citation Graph (0, 0)][DBLP ] FSE, 2007, pp:274-289 [Conf ] Martin Hell , Thomas Johansson Cryptanalysis of Achterbahn-Version 2. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2006, pp:45-55 [Conf ] Martin Hell , Thomas Johansson On the Problem of Finding Linear Approximations and Cryptanalysis of Pomaranch Version 2. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2006, pp:220-233 [Conf ] Breaking the F-FCSR-H Stream Cipher in Real Time. [Citation Graph (, )][DBLP ] Improving the Rainbow Attack by Reusing Colours. [Citation Graph (, )][DBLP ] An Efficient State Recovery Attack on X-FCSR-256. [Citation Graph (, )][DBLP ] A Framework for Chosen IV Statistical Analysis of Stream Ciphers. [Citation Graph (, )][DBLP ] Development of an Autonomous Forest Machine for Path Tracking. [Citation Graph (, )][DBLP ] Search in 0.036secs, Finished in 0.039secs