Matthias Krause

According to our database1, Matthias Krause authored at least 66 papers between 1988 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Tight Security Bounds for Generic Stream Cipher Constructions.
IACR Cryptology ePrint Archive, 2019

2018
Design and analysis of small-state grain-like stream ciphers.
Cryptography and Communications, 2018

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks.
Cryptography and Communications, 2018

2017
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.
IACR Trans. Symmetric Cryptol., 2017

On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks.
IACR Cryptology ePrint Archive, 2017

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers.
IACR Cryptology ePrint Archive, 2017

A Note on Stream Ciphers that Continuously Use the IV.
IACR Cryptology ePrint Archive, 2017

2016
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.
IACR Cryptology ePrint Archive, 2016

2015
Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes.
IACR Cryptology ePrint Archive, 2015

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks.
IACR Cryptology ePrint Archive, 2015

2014
Hardware Efficient Authentication based on Random Selection.
Proceedings of the Sicherheit 2014: Sicherheit, 2014

2013
Towards Search on Encrypted Graph Data.
Proceedings of the Workshop on Society, 2013

2011
The Cryptographic Power of Random Selection.
Proceedings of the Selected Areas in Cryptography - 18th International Workshop, 2011

The Preimage Security of Double-Block-Length Compression Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited.
IACR Cryptology ePrint Archive, 2010

Circuit Complexity.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009
More on the Security of Linear RFID Authentication Protocols.
Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

Algebraic Attacks against Linear RFID Authentication Protocols.
Proceedings of the Symmetric Cryptography, 11.01. - 16.01.2009, 2009

2007
OBDD-Based Cryptanalysis of Oblivious Keystream Generators.
Theory Comput. Syst., 2007

2006
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators.
Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

06111 Abstracts Collection -- Complexity of Boolean Functions.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

06111 Executive Summary -- Complexity of Boolean Functions.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005
On the influence of the variable ordering for algorithmic learning using OBDDs.
Inf. Comput., 2005

Design Principles for Combiners with Memory.
Proceedings of the Progress in Cryptology, 2005

2004
On relations between counting communication complexity classes.
J. Comput. Syst. Sci., 2004

2003
Algebraic Attacks on Combiners with Memory.
Proceedings of the Advances in Cryptology, 2003

2002
On the Computational Power of Boolean Decision Lists.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

BDD-Based Cryptanalysis of Keystream Generators.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

2001
BDD-based Cryptanalysis of Keystream Generators
Electronic Colloquium on Computational Complexity (ECCC), 2001

Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.
Computational Complexity, 2001

On the Minimal Hardware Complexity of Pseudorandom Function Generators.
Proceedings of the STACS 2001, 2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Improved Cryptanalysis of the Self-Shrinking Generator.
Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000
On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators
Electronic Colloquium on Computational Complexity (ECCC), 2000

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Electronic Colloquium on Computational Complexity (ECCC), 2000

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Approximations by OBDDs and the variable ordering problem
Electronic Colloquium on Computational Complexity (ECCC), 1999

Approximations by OBDDs and the Variable Ordering Problem.
Proceedings of the Automata, 1999

1998
Computing Boolean Functions by Polynomials and Threshold Circuits.
Computational Complexity, 1998

1997
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1995
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.
Mathematical Systems Theory, 1995

A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits
Electronic Colloquium on Computational Complexity (ECCC), 1995

On Realizing Iterated Multiplication by Small Depth Threshold Circuits.
Proceedings of the STACS 95, 1995

On Computing Boolean Functions by Sparse Real Polynomials.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Separating Oblivious Linear Length MODp-Branching Program Classes.
Elektronische Informationsverarbeitung und Kybernetik, 1994

On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates
Electronic Colloquium on Computational Complexity (ECCC), 1994

On the computational power of depth 2 circuits with threshold and modulo gates.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Constrained Combinatorial Optimization with an Evolution Strategy.
Proceedings of the Fuzzy Logik, 1994

1992
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
Inf. Comput., February, 1992

Separating Counting Communication Complexity Classes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines.
ITA, 1992

Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access.
ITA, 1992

Separating Counting Communication Complexity Classes.
Proceedings of the STACS 92, 1992

1991
On Oblivious Branching Programs of Linear Length
Inf. Comput., October, 1991

Lower Bounds for Depth-Restricted Branching Programs
Inf. Comput., March, 1991

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e.
Theor. Comput. Sci., 1991

Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989
Untere Schranken für Berechnungen durch Verzweigungsprogramme.
PhD thesis, 1989

Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

On Oblivious Branching Programs of Linear Length (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989

Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs.
Elektronische Informationsverarbeitung und Kybernetik, 1988

Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988


  Loading...