| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Matthias Krause |
Automatisierte Erstellung und Verfeinerung virtueller Prototypen für den Entwurf verteilter eingebetteter Systeme.  |
|
2011 |
RDF |
|
| 1 | Matthias Krause, Matthias Hamann |
The Cryptographic Power of Random Selection. |
IACR Cryptology ePrint Archive  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Matthias Hamann |
The Cryptographic Power of Random Selection. |
Selected Areas in Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger |
The Preimage Security of Double-Block-Length Compression Functions. |
ASIACRYPT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Frederik Armknecht, Ewan Fleischmann |
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Dirk Stegemann |
More on the Security of Linear RFID Authentication Protocols. |
Selected Areas in Cryptography |
2009 |
DBLP DOI BibTeX RDF |
RFID Authentication, HB ?+?, CKK, CKK 2, Algebraic Attacks, Lightweight Cryptography |
| 1 | Matthias Krause, Dominik Englert, Oliver Bringmann, Wolfgang Rosenstiel |
Combination of instruction set simulation and abstract RTOS model execution for fast and accurate target software evaluation. |
CODES+ISSS |
2008 |
DBLP DOI BibTeX RDF |
RTOS modeling, embedded systems, instruction set simulation |
| 1 | Matthias Krause |
OBDD-Based Cryptanalysis of Oblivious Keystream Generators. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Oliver Bringmann, André Hergenhan, Gökhan Tabanoglu, Wolfgang Rosenstiel |
Timing simulation of interconnected AUTOSAR software-components. |
DATE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
On the computational power of Boolean decision lists. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
94C05, Subject classification. 68Q15, 06E30, 94C10 |
| 1 | Frederik Armknecht, Matthias Krause |
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
matroid union algorithm, boolean functions, algebraic attacks, Cryptographic primitives |
| 1 | Matthias Krause, Dirk Stegemann |
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. |
FSE |
2006 |
DBLP DOI BibTeX RDF |
Bluetooth E0, GSM A5/1, cryptanalysis, Stream cipher, BDD, self-shrinking generator |
| 1 | Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek (eds.) |
Complexity of Boolean Functions, 12.03. - 17.03.2006 |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek |
06111 Abstracts Collection -- Complexity of Boolean Functions. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk |
06111 Executive Summary -- Complexity of Boolean Functions. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Oliver Bringmann, Wolfgang Rosenstiel |
Target software generation: an approach for automatic mapping of SystemC specifications onto real-time operating systems. |
Design Autom. for Emb. Sys. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Petr Savický, Ingo Wegener |
On the influence of the variable ordering for algorithmic learning using OBDDs. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederik Armknecht, Matthias Krause, Dirk Stegemann |
Design Principles for Combiners with Memory. |
INDOCRYPT |
2005 |
DBLP DOI BibTeX RDF |
combiners with memory, Bluetooth E0, Stream cipher, algebraic attacks, correlation attacks |
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
On relations between counting communication complexity classes. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Hans-Ulrich Simon |
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederik Armknecht, Matthias Krause |
Algebraic Attacks on Combiners with Memory. |
CRYPTO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
On the Computational Power of Boolean Decision Lists. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
Boolean Complexity Theory, Lower Bounds, Learnability |
| 1 | Matthias Krause |
BDD-Based Cryptanalysis of Keystream Generators. |
EUROCRYPT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
BDD-based Cryptanalysis of Keystream Generators |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause |
BDD-based Cryptanalysis of Keystream Generators. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Stefan Lucks |
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators |
| 1 | Erik Zenner, Matthias Krause, Stefan Lucks |
Improved Cryptanalysis of the Self-Shrinking Generator. |
ACISP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Stefan Lucks |
On the Minimal Hardware Complexity of Pseudorandom Function Generators. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
Boolean Complexity Theory, Computational Distinguishability, Cryptography, Pseudorandomness |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Hans-Ulrich Simon |
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Stefan Lucks |
On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon |
Contrast-optimal k out of n secret sharing schemes in visual cryptography. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Hans-Ulrich Simon |
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Petr Savický, Ingo Wegener |
Approximations by OBDDs and the variable ordering problem |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Petr Savický, Ingo Wegener |
Approximations by OBDDs and the Variable Ordering Problem. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák |
Computing Boolean Functions by Polynomials and Threshold Circuits. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
Complexity of Boolean functions, circuit lower bounds, representations by multivariate polynomials, threshold circuits |
| 1 | Matthias Krause, Pavel Pudlák |
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon |
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Stephan Waack |
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. |
Mathematical Systems Theory |
1995 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause |
On Realizing Iterated Multiplication by Small Depth Threshold Circuits. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák |
On Computing Boolean Functions by Sparse Real Polynomials. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
sparse real polynomials, threshold-parity circuits, threshold-and circuits, computational complexity, complexity, Boolean functions, Boolean functions, polynomials, polynomials |
| 1 | Matthias Krause, Pavel Pudlák |
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates |
Electronic Colloquium on Computational Complexity (ECCC) |
1994 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Oblivious Linear Length MODp-Branching Program Classes. |
Elektronische Informationsverarbeitung und Kybernetik |
1994 |
DBLP BibTeX RDF |
|
| 1 | Volker Nissen, Matthias Krause |
Constrained Combinatorial Optimization with an Evolution Strategy. |
Fuzzy Days |
1994 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák |
On the computational power of depth 2 circuits with threshold and modulo gates. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1992 |
RDF |
|
| 1 | Matthias Krause |
Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. |
ITA |
1992 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. |
ITA |
1992 |
DBLP BibTeX RDF |
|
| 1 | 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. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
complexity of Boolean function, communication complexity and distributed computing, probabilism, lower bound arguments, separation of complexity classes |
| 1 | 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. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause |
Lower Bounds for Depth-Restricted Branching Programs |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Waack, Matthias Krause |
On Oblivious Branching Programs of Linear Length |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
MOD m gate, communication matrices, depth two circuits, symmetric gates, unbounded fan-in, exponential lower bound, variation rank, threshold gate |
| 1 | Matthias Krause |
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause |
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Stephan Waack |
On Oblivious Branching Programs of Linear Length (Extended Abstract). |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. |
IFIP Congress |
1989 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause |
Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. |
Elektronische Informationsverarbeitung und Kybernetik |
1988 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")