Matthias Krause

Publication Activity (10 Years)

Years Active: 1988-2022
Publications (10 Years): 10

Top Venues

IACR Cryptol. ePrint Arch.

Cryptogr. Commun.

IACR Trans. Symmetric Cryptol.

SAC

Humboldt University of Berlin, Unter den Linden, Germany (PHD)

Education History

Humboldt University of Berlin, Unter den Linden, Germany

PHD

Publications

Matthias Hamann, Alexander Moch, Matthias Krause, Vasily Mikhalev
The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks. IACR Trans. Symmetric Cryptol. 2022 (2) (2022)
Matthias Hamann, Matthias Krause
Tight Security Bounds for Generic Stream Cipher Constructions. IACR Cryptol. ePrint Arch. 2019 (2019)
Matthias Hamann, Matthias Krause, Alexander Moch
Tight Security Bounds for Generic Stream Cipher Constructions. SAC (2019)
Matthias Hamann, Matthias Krause
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr. Commun. 10 (5) (2018)
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
Design and analysis of small-state grain-like stream ciphers. Cryptogr. Commun. 10 (5) (2018)
Matthias Hamann, Matthias Krause, Willi Meier
A Note on Stream Ciphers that Continuously Use the IV. IACR Cryptol. ePrint Arch. 2017 (2017)
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. IACR Cryptol. ePrint Arch. 2017 (2017)
Matthias Krause
On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks. IACR Cryptol. ePrint Arch. 2017 (2017)
Matthias Hamann, Matthias Krause, Willi Meier
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Trans. Symmetric Cryptol. 2017 (1) (2017)
Matthias Hamann, Matthias Krause, Willi Meier
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Cryptol. ePrint Arch. 2016 (2016)
Matthias Krause
Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes. IACR Cryptol. ePrint Arch. 2015 (2015)
Matthias Hamann, Matthias Krause
Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. IACR Cryptol. ePrint Arch. 2015 (2015)
Frederik Armknecht, Matthias Hamann, Matthias Krause
Hardware Efficient Authentication based on Random Selection. Sicherheit (2014)
Andreas Kasten, Ansgar Scherp, Frederik Armknecht, Matthias Krause
Towards Search on Encrypted Graph Data. PrivOn@ISWC (2013)
Matthias Krause, Matthias Hamann
The Cryptographic Power of Random Selection. IACR Cryptol. ePrint Arch. 2011 (2011)
Matthias Krause, Matthias Hamann
The Cryptographic Power of Random Selection. Selected Areas in Cryptography (2011)
Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger
The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT (2011)
Matthias Krause, Frederik Armknecht, Ewan Fleischmann
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited. IACR Cryptol. ePrint Arch. 2010 (2010)
Matthias Krause, Dirk Stegemann
Algebraic Attacks against Linear RFID Authentication Protocols. Symmetric Cryptography (2009)
Matthias Krause, Dirk Stegemann
More on the Security of Linear RFID Authentication Protocols. Selected Areas in Cryptography (2009)
Matthias Krause
OBDD-Based Cryptanalysis of Oblivious Keystream Generators. Theory Comput. Syst. 40 (1) (2007)
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions (2006)
Matthias Krause, Dirk Stegemann
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. FSE (2006)
Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions (2006)
Frederik Armknecht, Matthias Krause
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. ICALP (2) (2006)
Matthias Krause
On the computational power of Boolean decision lists. Comput. Complex. 14 (4) (2006)
Frederik Armknecht, Matthias Krause, Dirk Stegemann
Design Principles for Combiners with Memory. INDOCRYPT (2005)
Matthias Krause, Petr Savický, Ingo Wegener
On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201 (2) (2005)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69 (2) (2004)
Frederik Armknecht, Matthias Krause
Algebraic Attacks on Combiners with Memory. CRYPTO (2003)
Matthias Krause, Hans Ulrich Simon
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. Comb. Probab. Comput. 12 (3) (2003)
Matthias Krause
BDD-Based Cryptanalysis of Keystream Generators. EUROCRYPT (2002)
Matthias Krause
On the Computational Power of Boolean Decision Lists. STACS (2002)
Matthias Krause, Stefan Lucks
and cryptographic limitations to proving lower bounds. Comput. Complex. 10 (4) (2001)
Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS (2001)
Matthias Krause
BDD-based Cryptanalysis of Keystream Generators Electron. Colloquium Comput. Complex. (078) (2001)
Erik Zenner, Matthias Krause, Stefan Lucks
Improved Cryptanalysis of the Self-Shrinking Generator. ACISP (2001)
Matthias Krause
BDD-based Cryptanalysis of Keystream Generators. IACR Cryptol. ePrint Arch. 2001 (2001)
Matthias Krause, Stefan Lucks
On the Minimal Hardware Complexity of Pseudorandom Function Generators. STACS (2001)
Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240 (2) (2000)
Matthias Krause, Hans Ulrich Simon
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN (2000)
Matthias Krause, Stefan Lucks
On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators Electron. Colloquium Comput. Complex. 7 (14) (2000)
Matthias Krause, Hans Ulrich Simon
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography Electron. Colloquium Comput. Complex. 7 (3) (2000)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the variable ordering problem Electron. Colloquium Comput. Complex. 6 (11) (1999)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the Variable Ordering Problem. ICALP (1999)
Matthias Krause, Pavel Pudlák
Computing Boolean Functions by Polynomials and Threshold Circuits. Comput. Complex. 7 (4) (1998)
Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON (1997)
Matthias Krause, Pavel Pudlák
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. Theor. Comput. Sci. 174 (1-2) (1997)
Matthias Krause
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. Theor. Comput. Sci. 156 (1&2) (1996)
Matthias Krause
On Realizing Iterated Multiplication by Small Depth Threshold Circuits. STACS (1995)
Matthias Krause, Pavel Pudlák
On Computing Boolean Functions by Sparse Real Polynomials. FOCS (1995)
Matthias Krause
A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits Electron. Colloquium Comput. Complex. 2 (9) (1995)
Matthias Krause, Stephan Waack
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. Math. Syst. Theory 28 (6) (1995)
Volker Nissen, Matthias Krause
Constrained Combinatorial Optimization with an Evolution Strategy. Fuzzy Days (1994)
Matthias Krause, Pavel Pudlák
On the computational power of depth 2 circuits with threshold and modulo gates. STOC (1994)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
-Branching Program Classes. J. Inf. Process. Cybern. 30 (2) (1994)
Matthias Krause, Pavel Pudlák
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates Electron. Colloquium Comput. Complex. 1 (23) (1994)
Matthias Krause
Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. RAIRO Theor. Informatics Appl. 26 (1992)
Matthias Krause, Christoph Meinel, Stephan Waack
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. RAIRO Theor. Informatics Appl. 26 (1992)
Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits Inf. Comput. 96 (2) (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes Universität Trier, Mathematik/Informatik, Forschungsbericht (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes. STACS (1992)
Stephan Waack, Matthias Krause
On Oblivious Branching Programs of Linear Length Inf. Comput. 94 (2) (1991)
Matthias Krause
Lower Bounds for Depth-Restricted Branching Programs Inf. Comput. 91 (1) (1991)
Matthias Krause, Christoph Meinel, Stephan Waack
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. Theor. Comput. Sci. 86 (2) (1991)
Matthias Krause
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. Computational Complexity Conference (1991)
Matthias Krause, Stephan Waack
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In FOCS (1991)
Matthias Krause
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. MFCS (1990)
Matthias Krause, Stephan Waack
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT (1989)
Matthias Krause, Christoph Meinel, Stephan Waack
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress (1989)
Matthias Krause, Christoph Meinel, Stephan Waack
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. Computational Complexity Conference (1989)
Matthias Krause
Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. J. Inf. Process. Cybern. 24 (3) (1988)
Matthias Krause, Christoph Meinel, Stephan Waack
. MFCS (1988)

Matthias Krause.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Krause