Matthias Krause

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