default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Krause 0001
Person information
- affiliation: University of Mannheim, Germany
Other persons with the same name
- Matthias Krause 0002 — Eberhard Karls University of Tübingen (and 1 more)
- Matthias Krause 0003 — Philips Research Europe, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]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): 1-42 (2022)
2010 – 2019
- 2019
- [c30]Matthias Hamann, Matthias Krause, Alexander Moch:
Tight Security Bounds for Generic Stream Cipher Constructions. SAC 2019: 335-364 - [i20]Matthias Hamann, Matthias Krause:
Tight Security Bounds for Generic Stream Cipher Constructions. IACR Cryptol. ePrint Arch. 2019: 7 (2019) - 2018
- [j22]Matthias Hamann, Matthias Krause, Willi Meier
, Bin Zhang:
Design and analysis of small-state grain-like stream ciphers. Cryptogr. Commun. 10(5): 803-834 (2018) - [j21]Matthias Hamann, Matthias Krause:
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr. Commun. 10(5): 959-1012 (2018) - 2017
- [j20]Matthias Hamann, Matthias Krause, Willi Meier:
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Trans. Symmetric Cryptol. 2017(1): 45-79 (2017) - [i19]Matthias Krause:
On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks. IACR Cryptol. ePrint Arch. 2017: 289 (2017) - [i18]Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang:
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. IACR Cryptol. ePrint Arch. 2017: 384 (2017) - [i17]Matthias Hamann, Matthias Krause, Willi Meier:
A Note on Stream Ciphers that Continuously Use the IV. IACR Cryptol. ePrint Arch. 2017: 1172 (2017) - 2016
- [i16]Matthias Hamann, Matthias Krause, Willi Meier:
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Cryptol. ePrint Arch. 2016: 926 (2016) - 2015
- [i15]Matthias Krause:
Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes. IACR Cryptol. ePrint Arch. 2015: 636 (2015) - [i14]Matthias Hamann, Matthias Krause:
Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. IACR Cryptol. ePrint Arch. 2015: 757 (2015) - 2014
- [c29]Frederik Armknecht, Matthias Hamann, Matthias Krause:
Hardware Efficient Authentication based on Random Selection. Sicherheit 2014: 169-185 - 2013
- [c28]Andreas Kasten, Ansgar Scherp, Frederik Armknecht, Matthias Krause:
Towards Search on Encrypted Graph Data. PrivOn@ISWC 2013 - 2011
- [c27]Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT 2011: 233-251 - [c26]Matthias Krause, Matthias Hamann:
The Cryptographic Power of Random Selection. Selected Areas in Cryptography 2011: 134-150 - [i13]Matthias Krause, Matthias Hamann:
The Cryptographic Power of Random Selection. IACR Cryptol. ePrint Arch. 2011: 511 (2011) - 2010
- [p1]Matthias Krause, Ingo Wegener, Yves Crama, Peter L. Hammer:
Circuit Complexity. Boolean Models and Methods 2010: 506-530 - [i12]Matthias Krause, Frederik Armknecht, Ewan Fleischmann:
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited. IACR Cryptol. ePrint Arch. 2010: 519 (2010)
2000 – 2009
- 2009
- [c25]Matthias Krause, Dirk Stegemann:
More on the Security of Linear RFID Authentication Protocols. Selected Areas in Cryptography 2009: 182-196 - [i11]Matthias Krause, Dirk Stegemann:
Algebraic Attacks against Linear RFID Authentication Protocols. Symmetric Cryptography 2009 - 2007
- [j19]Matthias Krause:
OBDD-Based Cryptanalysis of Oblivious Keystream Generators. Theory Comput. Syst. 40(1): 101-121 (2007) - 2006
- [j18]Matthias Krause:
On the computational power of Boolean decision lists. Comput. Complex. 14(4): 362-375 (2006) - [c24]Matthias Krause, Dirk Stegemann:
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. FSE 2006: 163-178 - [c23]Frederik Armknecht, Matthias Krause:
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. ICALP (2) 2006: 180-191 - [e1]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i10]Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i9]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - 2005
- [j17]Matthias Krause, Petr Savický, Ingo Wegener:
On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201(2): 160-177 (2005) - [c22]Frederik Armknecht, Matthias Krause, Dirk Stegemann:
Design Principles for Combiners with Memory. INDOCRYPT 2005: 104-117 - 2004
- [j16]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004) - 2003
- [j15]Matthias Krause, Hans Ulrich Simon:
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. Comb. Probab. Comput. 12(3): 285-299 (2003) - [c21]Frederik Armknecht, Matthias Krause:
Algebraic Attacks on Combiners with Memory. CRYPTO 2003: 162-175 - 2002
- [c20]Matthias Krause:
BDD-Based Cryptanalysis of Keystream Generators. EUROCRYPT 2002: 222-237 - [c19]Matthias Krause:
On the Computational Power of Boolean Decision Lists. STACS 2002: 372-383 - 2001
- [j14]Matthias Krause, Stefan Lucks:
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. Comput. Complex. 10(4): 297-313 (2001) - [c18]Erik Zenner, Matthias Krause, Stefan Lucks:
Improved Cryptanalysis of the Self-Shrinking Generator. ACISP 2001: 21-35 - [c17]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: 171-182 - [c16]Matthias Krause, Stefan Lucks:
On the Minimal Hardware Complexity of Pseudorandom Function Generators. STACS 2001: 419-430 - [i8]Matthias Krause:
BDD-based Cryptanalysis of Keystream Generators. Electron. Colloquium Comput. Complex. TR01 (2001) - [i7]Matthias Krause:
BDD-based Cryptanalysis of Keystream Generators. IACR Cryptol. ePrint Arch. 2001: 92 (2001) - 2000
- [j13]Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon:
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240(2): 471-485 (2000) - [c15]Matthias Krause, Hans Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN 2000: 280-291 - [i6]Matthias Krause, Hans Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. Electron. Colloquium Comput. Complex. TR00 (2000) - [i5]Matthias Krause, Stefan Lucks:
On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c14]Matthias Krause, Petr Savický, Ingo Wegener:
Approximations by OBDDs and the Variable Ordering Problem. ICALP 1999: 493-502 - [i4]Matthias Krause, Petr Savický, Ingo Wegener:
Approximations by OBDDs and the variable ordering problem. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j12]Matthias Krause, Pavel Pudlák:
Computing Boolean Functions by Polynomials and Threshold Circuits. Comput. Complex. 7(4): 346-370 (1998) - 1997
- [j11]Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. Theor. Comput. Sci. 174(1-2): 137-156 (1997) - [c13]Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon:
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON 1997: 176-185 - 1996
- [j10]Matthias Krause:
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. Theor. Comput. Sci. 156(1&2): 99-117 (1996) - 1995
- [j9]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): 553-564 (1995) - [c12]Matthias Krause, Pavel Pudlák:
On Computing Boolean Functions by Sparse Real Polynomials. FOCS 1995: 682-691 - [c11]Matthias Krause:
On Realizing Iterated Multiplication by Small Depth Threshold Circuits. STACS 1995: 83-94 - [i3]Matthias Krause:
A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j8]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Oblivious Linear Length MODp-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994) - [c10]Volker Nissen, Matthias Krause:
Constrained Combinatorial Optimization with an Evolution Strategy. Fuzzy Days 1994: 33-40 - [c9]Matthias Krause, Pavel Pudlák:
On the computational power of depth 2 circuits with threshold and modulo gates. STOC 1994: 48-57 - [i2]Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates. Electron. Colloquium Comput. Complex. TR94 (1994) - 1992
- [j7]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): 168-178 (1992) - [j6]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. RAIRO Theor. Informatics Appl. 26: 345-362 (1992) - [j5]Matthias Krause:
Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. RAIRO Theor. Informatics Appl. 26: 507-522 (1992) - [c8]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. STACS 1992: 281-292 - [i1]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992) - 1991
- [j4]Matthias Krause:
Lower Bounds for Depth-Restricted Branching Programs. Inf. Comput. 91(1): 1-14 (1991) - [j3]Stephan Waack, Matthias Krause:
On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (1991) - [j2]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): 267-275 (1991) - [c7]Matthias Krause:
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. SCT 1991: 314-321 - [c6]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: 777-782 - 1990
- [c5]Matthias Krause:
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. MFCS 1990: 385-391
1980 – 1989
- 1989
- [b1]Matthias Krause:
Untere Schranken für Berechnungen durch Verzweigungsprogramme. Humboldt University of Berlin, Unter den Linden, Germany, 1989 - [c4]Matthias Krause, Christoph Meinel, Stephan Waack:
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. SCT 1989: 240-249 - [c3]Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296 - [c2]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292 - 1988
- [j1]Matthias Krause:
Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. J. Inf. Process. Cybern. 24(3): 99-110 (1988) - [c1]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. MFCS 1988: 405-413
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
