Matthias Krause

发表

More on Computing Boolean Functions by Sparse Real Polynomials and Related Types of Threshold Circuits

Matthias Krause, 1996 .

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

Hans Ulrich Simon, Matthias Krause, H. Simon, 2000, Combinatorics, Probability and Computing.

Separating the eraser Turing machine classes I+, NIL,, co-N!+_ and P,

Christoph Meinel, Matthias Krause, Stephan Waack, 1991 .

Preimage Resistance Beyond the Birthday Barrier – The Case of Blockcipher Based Hashing

Frederik Armknecht, Matthias Krause, Ewan Fleischmann, 2010 .

after the latest revision in 2012 : Grain v 1 [

A. Shamir, David Wagner, A. Biryukov, 2017 .

Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines

Christoph Meinel, Matthias Krause, Stephan Waack, 1989, IFIP Congress.

A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks

Matthias Krause, Matthias Hamann, A. Moch, 2022 .

Separating Oblivious Linear Length MODp-Branching Program Classes

Christoph Meinel, Carsten Damm, Matthias Krause, 1994, J. Inf. Process. Cybern..

Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe

Christoph Meinel, Matthias Krause, Stephan Waack, 1988, International Symposium on Mathematical Foundations of Computer Science.

On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators

Stefan Lucks, Matthias Krause, Matthias Krause, 2000, Electron. Colloquium Comput. Complex..

Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In

Matthias Krause, Stephan Waack, Matthias Krause, 1995, Math. Syst. Theory.

Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited

Frederik Armknecht, Matthias Krause, Ewan Fleischmann, 2010, IACR Cryptol. ePrint Arch..

Complexity of Boolean Functions, 12.03. - 17.03.2006

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs

Matthias Krause, Matthias Krause, 1988, Journal of Information Processing and Cybernetics.

A Note on Stream Ciphers that Continuously Use the IV

Willi Meier, Matthias Krause, Matthias Hamann, 2017, IACR Cryptol. ePrint Arch..

On Oblivious Branching Programs of Linear Length (Extended Abstract)

Matthias Krause, Stephan Waack, Matthias Krause, 1989, FCT.

Separating ⊕ L, NL, co-NL and AL (=P) for oblivious Turing machines

Matthias Krause, Matthias Krause, 1990 .

Towards Search on Encrypted Graph Data

Frederik Armknecht, Ansgar Scherp, Matthias Krause, 2013, PrivOn@ISWC.

Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in

Matthias Krause, Stephan Waack, Matthias Krause, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Geometric arguments yield better bounds for threshold circuits and distributed computing

Matthias Krause, Matthias Krause, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

On relations between counting communication complexity classes

Christoph Meinel, Carsten Damm, Matthias Krause, 2004, J. Comput. Syst. Sci..

Contrast-optimal k out of n secret sharing schemes in visual cryptography

Hans Ulrich Simon, Matthias Krause, Thomas Hofmeister, 1997, Theor. Comput. Sci..

Circuit Complexity

Peter L. Hammer, Yves Crama, Ingo Wegener, 2010, Boolean Models and Methods.

On Using Penalty Functions and Multicriteria Optimisation Techniques in Facility Layout

Volker Nissen, Matthias Krause, Matthias Krause, 1995 .

On the influence of the variable ordering for algorithmic learning using OBDDs

Ingo Wegener, Matthias Krause, Petr Savický, 2005, Inf. Comput..

Approximations by OBDDs and the Variable Ordering Problem

Ingo Wegener, Matthias Krause, Petr Savický, 1999, ICALP.

Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time

Matthias Krause, Matthias Krause, 1990, MFCS.

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

Matthias Krause, Matthias Krause, 1992, RAIRO Theor. Informatics Appl..

Algebraic Attacks on Combiners with Memory

Frederik Armknecht, Matthias Krause, Matthias Krause, 2003, CRYPTO.

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices

Willi Meier, Matthias Krause, Matthias Hamann, 2017, IACR Trans. Symmetric Cryptol..

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e

Christoph Meinel, Matthias Krause, Stephan Waack, 1991, Theor. Comput. Sci..

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks

Matthias Krause, Matthias Hamann, Matthias Krause, 2018, Cryptography and Communications.

On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks

Matthias Krause, Matthias Krause, 2017, IACR Cryptol. ePrint Arch..

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks

Matthias Krause, Matthias Hamann, Matthias Krause, 2015, IACR Cryptol. ePrint Arch..

Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes

Matthias Krause, Matthias Krause, 2015, IACR Cryptol. ePrint Arch..

More on the Security of Linear RFID Authentication Protocols

Matthias Krause, Dirk Stegemann, Matthias Krause, 2009, Selected Areas in Cryptography.

OBDD-Based Cryptanalysis of Oblivious Keystream Generators

Matthias Krause, Matthias Krause, 2007, Theory of Computing Systems.

Tight Security Bounds for Generic Stream Cipher Constructions

Matthias Krause, Matthias Hamann, Matthias Krause, 2019, SAC.

Design and analysis of small-state grain-like stream ciphers

Bin Zhang, Willi Meier, Matthias Krause, 2017, Cryptography and Communications.

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers

Bin Zhang, Willi Meier, Matthias Krause, 2017, IACR Cryptol. ePrint Arch..