Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. - Matthias Krause 001; Christoph Meinel; Stephan Waack (MFCS, 1988)

Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. - Matthias Krause 001 (J. Inf. Process. Cybern., 1988)

Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. - Matthias Krause 001; Christoph Meinel; Stephan Waack (SCT, 1989)

On Oblivious Branching Programs of Linear Length (Extended Abstract). - Matthias Krause 001; Stephan Waack (FCT, 1989)

Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. - Matthias Krause 001; Christoph Meinel; Stephan Waack (IFIP Congress, 1989)

Untere Schranken für Berechnungen durch Verzweigungsprogramme. - Matthias Krause 001 (1989)

Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. - Matthias Krause 001 (MFCS, 1990)

Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In - Matthias Krause 001; Stephan Waack (FOCS, 1991)

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. - Matthias Krause 001; Christoph Meinel; Stephan Waack (Theor. Comput. Sci., 1991)

Lower Bounds for Depth-Restricted Branching Programs - Matthias Krause 001 (Inf. Comput., 1991)

On Oblivious Branching Programs of Linear Length - Stephan Waack; Matthias Krause 001 (Inf. Comput., 1991)

Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. - Matthias Krause 001 (RAIRO Theor. Informatics Appl., 1992)

Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. - Matthias Krause 001; Christoph Meinel; Stephan Waack (RAIRO Theor. Informatics Appl., 1992)

Separating Counting Communication Complexity Classes - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992)

Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits - Juraj Hromkovic; Matthias Krause 001; Christoph Meinel; Stephan Waack (Inf. Comput., 1992)

Constrained Combinatorial Optimization with an Evolution Strategy. - Volker Nissen; Matthias Krause 001 (Fuzzy Days, 1994)

Separating Oblivious Linear Length MODp-Branching Program Classes. - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (J. Inf. Process. Cybern., 1994)

On Computing Boolean Functions by Sparse Real Polynomials. - Matthias Krause 001; Pavel Pudlák (FOCS, 1995)

On Realizing Iterated Multiplication by Small Depth Threshold Circuits. - Matthias Krause 001 (STACS, 1995)

A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits - Matthias Krause 001 (Electron. Colloquium Comput. Complex., 1995)

Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. - Matthias Krause 001; Stephan Waack (Math. Syst. Theory, 1995)

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. - Matthias Krause 001 (Theor. Comput. Sci., 1996)

On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. - Matthias Krause 001; Pavel Pudlák (Theor. Comput. Sci., 1997)

Computing Boolean Functions by Polynomials and Threshold Circuits. - Matthias Krause 001; Pavel Pudlák (Comput. Complex., 1998)

Approximations by OBDDs and the variable ordering problem - Matthias Krause 001; Petr Savický; Ingo Wegener (Electron. Colloquium Comput. Complex., 1999)

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography - Matthias Krause 001; Hans Ulrich Simon (Electron. Colloquium Comput. Complex., 2000)

On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators - Matthias Krause 001; Stefan Lucks (Electron. Colloquium Comput. Complex., 2000)

Contrast-optimal k out of n secret sharing schemes in visual cryptography. - Thomas Hofmeister; Matthias Krause 001; Hans Ulrich Simon (Theor. Comput. Sci., 2000)

Improved Cryptanalysis of the Self-Shrinking Generator. - Erik Zenner; Matthias Krause 001; Stefan Lucks (ACISP, 2001)

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. - Jürgen Forster; Matthias Krause 001; Satyanarayana V. Lokam; Rustam Mubarakzjanov; Niels Schmitt; Hans Ulrich Simon (FSTTCS, 2001)

On the Minimal Hardware Complexity of Pseudorandom Function Generators. - Matthias Krause 001; Stefan Lucks (STACS, 2001)

Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. - Matthias Krause 001; Stefan Lucks (Comput. Complex., 2001)

BDD-based Cryptanalysis of Keystream Generators - Matthias Krause 001 (Electron. Colloquium Comput. Complex., 2001)

Algebraic Attacks on Combiners with Memory. - Frederik Armknecht; Matthias Krause 001 (CRYPTO, 2003)

On relations between counting communication complexity classes. - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (J. Comput. Syst. Sci., 2004)

Design Principles for Combiners with Memory. - Frederik Armknecht; Matthias Krause 001; Dirk Stegemann (INDOCRYPT, 2005)

On the influence of the variable ordering for algorithmic learning using OBDDs. - Matthias Krause 001; Petr Savický; Ingo Wegener (Inf. Comput., 2005)

06111 Executive Summary – Complexity of Boolean Functions. - Matthias Krause 001; Dieter van Melkebeek; Pavel Pudlák; Rüdiger Reischuk (Complexity of Boolean Functions, 2006)

06111 Abstracts Collection – Complexity of Boolean Functions. - Matthias Krause 001; Pavel Pudlák; Rüdiger Reischuk; Dieter van Melkebeek (Complexity of Boolean Functions, 2006)

Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. - Matthias Krause 001; Dirk Stegemann (FSE, 2006)

Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. - Frederik Armknecht; Matthias Krause 001 (ICALP (2), 2006)

On the computational power of Boolean decision lists. - Matthias Krause 001 (Comput. Complex., 2006)

OBDD-Based Cryptanalysis of Oblivious Keystream Generators. - Matthias Krause 001 (Theory Comput. Syst., 2007)

Algebraic Attacks against Linear RFID Authentication Protocols. - Matthias Krause 001; Dirk Stegemann (Symmetric Cryptography, 2009)

More on the Security of Linear RFID Authentication Protocols. - Matthias Krause 001; Dirk Stegemann (Selected Areas in Cryptography, 2009)

Circuit Complexity. - Matthias Krause 001; Ingo Wegener; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited. - Matthias Krause 001; Frederik Armknecht; Ewan Fleischmann (IACR Cryptol. ePrint Arch., 2010)

The Preimage Security of Double-Block-Length Compression Functions. - Frederik Armknecht; Ewan Fleischmann; Matthias Krause 001; Jooyoung Lee 001; Martijn Stam; John P. Steinberger (ASIACRYPT, 2011)

The Cryptographic Power of Random Selection. - Matthias Krause 001; Matthias Hamann (IACR Cryptol. ePrint Arch., 2011)

Towards Search on Encrypted Graph Data. - Andreas Kasten; Ansgar Scherp; Frederik Armknecht; Matthias Krause 001 (PrivOn@ISWC, 2013)

Hardware Efficient Authentication based on Random Selection. - Frederik Armknecht; Matthias Hamann; Matthias Krause 001 (Sicherheit, 2014)

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. - Matthias Hamann; Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2015)

Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes. - Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2015)

A Note on Stream Ciphers that Continuously Use the IV. - Matthias Hamann; Matthias Krause 001; Willi Meier (IACR Cryptol. ePrint Arch., 2017)

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. - Matthias Hamann; Matthias Krause 001; Willi Meier; Bin Zhang 003 (IACR Cryptol. ePrint Arch., 2017)

On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks. - Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2017)

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. - Matthias Hamann; Matthias Krause 001; Willi Meier (IACR Trans. Symmetric Cryptol., 2017)

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. - Matthias Hamann; Matthias Krause 001 (Cryptogr. Commun., 2018)

Design and analysis of small-state grain-like stream ciphers. - Matthias Hamann; Matthias Krause 001; Willi Meier; Bin Zhang 003 (Cryptogr. Commun., 2018)

Tight Security Bounds for Generic Stream Cipher Constructions. - Matthias Hamann; Matthias Krause 001; Alexander Moch (SAC, 2019)

Tight Security Bounds for Generic Stream Cipher Constructions. - Matthias Hamann; Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2019)

The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks. - Matthias Hamann; Alexander Moch; Matthias Krause 001; Vasily Mikhalev (IACR Trans. Symmetric Cryptol., 2022)