Matthias Krause

发表

Pseudorandom functions in $ \textit{TC}^{0} $ and cryptographic limitations to proving lower bounds

Stefan Lucks, Matthias Krause, 2001, computational complexity.

Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines

Christoph Meinel, Matthias Krause, Stephan Waack, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

Complexity of Boolean Functions, 12.03. - 17.03.2006

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

SystemC-Based Performance Analysis of Embedded Systems

Alexander Viehl, Oliver Bringmann, Matthias Krause, 2009, Model-Based Design for Embedded Systems.

On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates

Pavel Pudlák, Matthias Krause, 1997, Theor. Comput. Sci..

More on the Security of Linear RFID Authentication Protocols

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

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

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

Algebraic Attacks against Linear RFID Authentication Protocols

Matthias Krause, Dirk Stegemann, 2009, Symmetric Cryptography.

Algebraic Attacks on Combiners with Memory

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

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

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

Design Principles for Combiners with Memory

Frederik Armknecht, Matthias Krause, Dirk Stegemann, 2005, INDOCRYPT.

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.

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

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

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.

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

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

On the computational power of depth 2 circuits with threshold and modulo gates

Pavel Pudlák, Matthias Krause, 1994, STOC '94.

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing

Matthias Krause, 1996, Theor. Comput. Sci..

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.

OBDD-Based Cryptanalysis of Oblivious Keystream Generators

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

Hardware Efficient Authentication based on Random Selection

Frederik Armknecht, Matthias Krause, Matthias Hamann, 2014, Sicherheit.

A Note on Stream Ciphers that Continuously Use the IV

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

On the Minimal Hardware Complexity of Pseudorandom Function Generators

Stefan Lucks, Matthias Krause, 2001, STACS.

Separating Counting Communication Complexity Classes

Christoph Meinel, Carsten Damm, Matthias Krause, 1992, STACS.

Computing Boolean functions by polynomials and threshold circuits

Pavel Pudlák, Matthias Krause, 1998, computational complexity.

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

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

On Using Penalty Functions and Multicriteria Optimisation Techniques in Facility Layout

Volker Nissen, Matthias Krause, Matthias Krause, 1995 .

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices

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

On the Computational Power of Boolean Decision Lists

Matthias Krause, 2002, STACS.

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.

The Cryptographic Power of Random Selection

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

On Oblivious Branching Programs of Linear Length (Extended Abstract)

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

Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography

Hans Ulrich Simon, Matthias Krause, 2003, Comb. Probab. Comput..

06111 Abstracts Collection -- Complexity of Boolean Functions

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

On relations between counting communication complexity classes

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

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..

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..

Untere Schranken für Berechnungen durch Verzweigungsprogramme

Matthias Krause, 1988 .

Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits

Christoph Meinel, Juraj Hromkovic, Matthias Krause, 1992, Inf. Comput..

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..

Verification of AUTOSAR Software by SystemC-Based Virtual Prototyping

Wolfgang Rosenstiel, Oliver Bringmann, Matthias Krause, 2009 .

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

Satyanarayana V. Lokam, Hans Ulrich Simon, Matthias Krause, 2001, FSTTCS.

BDD-Based Cryptanalysis of Keystream Generators

Matthias Krause, 2002, EUROCRYPT.

Improved Cryptanalysis of the Self-Shrinking Generator

Stefan Lucks, Matthias Krause, Erik Zenner, 2001, ACISP.

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

Matthias Krause, Matthias Krause, 1990, MFCS.

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

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

Constrained Combinatorial Optimization with an Evolution Strategy

Volker Nissen, Matthias Krause, 1994, Fuzzy Days.

On computing Boolean functions by sparse real polynomials

Pavel Pudlák, Matthias Krause, 1995, Proceedings of IEEE 36th Annual 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.

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

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

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

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

AquaRating: Un estándar internacional para evaluar los servicios de agua y saneamiento

Matthias Krause, Francisco Cubillo, Carlos Díaz, 2015 .

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

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

Target oriented driveability calibration through standardized processes and tailored tool support

Matthias Krause, Stefan Pischinger, Bert Kinoo, 2011 .

Towards Search on Encrypted Graph Data

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

Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators

Matthias Krause, Dirk Stegemann, 2006, FSE.

Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines

Christoph Meinel, Matthias Krause, Stephan Waack, 1992, RAIRO Theor. Informatics Appl..

Approximations by OBDDs and the Variable Ordering Problem

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

On Realizing Iterated Multiplication by Small Depth Threshold Circuits

Matthias Krause, 1995, STACS.

Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity

Frederik Armknecht, Matthias Krause, 2006, ICALP.

On the computational power of Boolean decision lists

Matthias Krause, 2005, computational complexity.

On Oblivious Branching Programs of Linear Length

Matthias Krause, Stephan Waack, 1991, Inf. Comput..

Tight Security Bounds for Generic Stream Cipher Constructions

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

06111 Executive Summary -- Complexity of Boolean Functions

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

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

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

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

Matthias Krause, Matthias Krause, 1990 .

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks

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

Separating Oblivious Linear Length MODp-Branching Program Classes

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

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

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

Circuit Complexity

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

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

Frederik Armknecht, Matthias Krause, Ewan Fleischmann, 2010 .

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

Christoph Meinel, Matthias Krause, Stephan Waack, 1991 .