2023

Moch, Alexander (2023) Provable security against generic attacks on stream ciphers. Journal of Mathematical Cryptology Berlin 17 1, Article 20220033 1-27 [Zeitschriftenartikel]

Moch, Alexander Julian (2023) Provable security for lightweight message authentication and encryption. Mannheim [Dissertation]

2022

Hamann, Matthias ; Moch, Alexander ; Krause, Matthias ; Mikhalev, Vasily (2022) The DRACO stream cipher: a power-efficient small-state stream cipher with full provable security against TMDTO attacks. IACR Transactions on Symmetric Cryptology Bochum 2022 2 1-42 [Zeitschriftenartikel]

2021

Hertling, Claus ; Krause, Matthias ; Schmidt, Martin U. ORCID: 0000-0002-1775-4701 (2021) Innovation, Interdisziplinarität und Internationalität: Die Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik. Borgstedt, Angela ; Eichfelder, Sandra ; Gassert, Philipp Eine Universität für die Gesellschaft : 75 Jahre Neubegründung Wirtschaftshochschule und Universität Mannheim Ubstadt-Weiher 129-132 [Buchkapitel]

2020

Hamann, Matthias ; Krause, Matthias ; Moch, Alexander Tight security bounds for generic stream cipher constructions. Paterson, Kenneth G. ; Stebila, Douglas Lecture Notes in Computer Science 11959 335-364 In: Selected areas in cryptography - SAC 2019 : 26th international conference, Waterloo, ON, Canada, August 12-16, 2019 : revised selected papers (2020) Berlin [u.a.] SAC 2019 (Waterloo, ON) [Konferenzveröffentlichung]

2019

Hamann, Matthias ; Krause, Matthias (2019) Tight security bounds for generic stream cipher constructions. Cryptology ePrint Archive Santa Barbara, CA Report 2019/007 [Arbeitspapier]

2018

Hamann, Matthias (2018) Lightweight cryptography on ultra-constrained RFID devices. Mannheim [Dissertation]

Vorschau

Hamann, Matthias ; Krause, Matthias ; Meier, Willi ; Zhang, Bin (2018) Design and analysis of small-state grain-like stream ciphers. Cryptography and Communications New York, NY [u.a.] 10 5 803-834 [Zeitschriftenartikel]

Hamann, Matthias ; Krause, Matthias (2018) On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptography and Communications New York, NY [u.a.] 10 5 959-1012 [Zeitschriftenartikel]

2017

Hamann, Matthias ; Krause, Matthias ; Meier, Willi ; Zhang, Bin (2017) Time-memory-data tradeoff attacks against small-state stream ciphers. Cryptology ePrint Archive Santa Barbara, CA Report 2017/384 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2017) LIZARD - A lightweight stream cipher for power-constrained devices. IACR Transactions on Symmetric Cryptology Bochum 2017 1 45-79 [Zeitschriftenartikel]

Krause, Matthias (2017) On the hardness of trivium and grain with respect to generic time-memory-data trade off attacks. Cryptology ePrint Archive Santa Barbara, CA Report 2017/289 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2017) A note on stream ciphers that continuously use the IV. Cryptology ePrint Archive Santa Barbara, CA Report 2017/1172 [Arbeitspapier]

2016

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2016) LIZARD – A lightweight stream cipher for power-constrained devices. Cryptology ePrint Archive Santa Barbara, CA Report 2016/926 [Arbeitspapier]

2015

Krause, Matthias (2015) Analyzing constructions for key-alternating pseudorandom functions with applications to stream cipher operation modes. Cryptology ePrint Archive Santa Barbara, CA Report 2015/636 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias (2015) Stream cipher operation modes with improved security against generic collision attacks. Cryptology ePrint Archive Santa Barbara, CA Report 2015/757 [Arbeitspapier]

2014

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Hamann, Matthias ; Mikhalev, Vasily Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts. Saxena, Nitesh Lecture Notes in Computer Science 8651 1-18 In: Radio Frequency Identification: Security and Privacy Issues : 10th International Workshop, RFIDSec 2014, Oxford, UK, July 21-23, 2014, Revised Selected Papers (2014) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Hamann, Matthias ; Krause, Matthias Hardware Efficient Authentication based on Random Selection. Katzenbeisser, Stefan GI-Edition : Lecture Notes in Informatics. Proceedings 228 169-185 In: Sicherheit 2014 - Sicherheit, Schutz und Zuverlässigkeit : [Beiträge der 7. Jahrestagung des Fachbereichs Sicherheit in der Gesellschaft für Informatik e. V. (GI);] 19. - 21. März 2014 in Wien (2014) Bonn [Konferenzveröffentlichung]

2013

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Seifert, Jean-Pierre Third International Workshop on Trustworthy Embedded Devices (TrustED 2013). Sadeghi, Ahmad-Reza 1479-1480 In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security : CCS'13 ; November 4-8, 2013, Berlin, Germany (2013) New York, NY [Konferenzveröffentlichung]

Vorschau

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Hauptmann, Manuel ; Roos, Stefanie ; Strufe, Thorsten (2013) Protecting Public OSN Posts from Unintended Access. Mannheim [u.a.] [Arbeitspapier]

Vorschau

Kasten, Andreas ; Scherp, Ansgar ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Towards Search on Encrypted Graph Data. Decker, Stefan CEUR Workshop Proceedings 1121 Paper 5 In: PrivOn 2013 : Proceedings of the Workshop on Society, Privacy and the Semantic Web - Policy and Technology (PrivOn2013) co-located with the 12th International Semantic Web Conference (ISWC 2013) Sydney, Australia, October 22, 2013 (2013) Aachen, Germany [Konferenzveröffentlichung]

2012

Tatli, Emin Islam Google Reveals Cryptographic Secrets. Katzenbeisser, Stefan Reihe Informatik / Technical report 33-36 In: Book of Abstracts Krypto-Tage 2004 - 2012 (2012) Darmstadt Kryptowochenende 2006 - Workshop ̈über Kryptographie (Bronnbach) [Konferenzveröffentlichung]

Krause, Matthias ; Hamann, Matthias The Cryptographic Power of Random Selection. Miri, Ali Lecture Notes in Computer Science 7118 134-150 In: Selected Areas in Cryptography (2012) Berlin [u.a.] (Toronto, Canada) [Konferenzveröffentlichung]

Symmetric Cryptography : Report from Dagstuhl Seminar 12031. Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Lucks, Stefan ; Preneel, Bart ; Rogaway, Philip Dagstuhl Reports 2 39-49 In: Symmetric Cryptography : Dagstuhl Seminar 12031 (2012) Wadern Dagstuhl Seminar 12031 (Dagstuhl, Germany) [Konferenzveröffentlichung]

Vorschau

2011

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Maes, Roel ; Sadeghi, Ahmad-Reza ; Standaert, Francois-Xavier ; Wachsmann, Christian A formalization of the security features of physical functions. O’Conner, Lisa 397-412 In: Proceedings of the 2011 IEEE Symposium on Security and Privacy (2011) Washington, DC (Berkeley, CA) [Konferenzveröffentlichung]

Stegemann, Dirk (2011) Selected Cryptographic Methods for Securing Low-End Devices. Mannheim [Dissertation]

Vorschau

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Fleischmann, Ewan ; Krause, Matthias ; Lee, Jooyoung ; Stam, Martijn ; Steinberger, John The preimage security of double-block-length compression functions. Lee, Dong Hoon Lecture Notes in Computer Science 7073 233-251 In: Advances in cryptology : proceedings / ASIACRYPT 2011, 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4 - 8, 2011 (2011) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Augot, Daniel ; Perret, Ludovic ; Sadeghi, Ahmad-Reza On constructing homomorphic encryption schemes from coding theory. Chen, Liqun Lecture Notes in Computer Science 7089 23-40 In: Cryptography and coding : 13th IMA International Conference, IMACC 2011, Oxford, UK, December 2011; proceedings (2011) Berlin [u.a.] IMACC 2011 (Oxford, UK) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Strufe, Thorsten An efficient distributed privacy-preserving eecommendation system. 65-70 In: 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net) (2011) Washington, DC [u.a.] (Favignana Island, Sicily) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Furukawa, Jun On the minimum communication effort for secure group key exchange. Biryukov, Alex Lecture Notes in Computer Science 6544 320-337 In: Selected areas in cryptography : 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12 - 13, 2010; revised selected papers (2011) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Elsner, Carsten ; Schmidt, Martin U. ORCID: 0000-0002-1775-4701 Using the inhomogeneous simultaneous approximation problem for cryptographic design. Nitaj, Abderrahmane Lecture Notes in Computer Science 6737 242-259 In: Progress in cryptology - AFRICACRYPT 2011 : 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5 - 7, 2011; proceedings (2011) Berlin [u.a.] AFRICACRYPT 2011 (Dakar, Senegal) [Konferenzveröffentlichung]

Krause, Matthias ; Hamann, Matthias (2011) The cryptographic power of random selection. Cryptology ePrint Archive Santa Barbara, CA Report 2011/511 [Arbeitspapier]

2010

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Chen, Liqun ; Sadeghi, Ahmad-Reza ; Wachsmann, Christian Anonymous authentication for RFID systems. Ors Yalcin, Siddika Berna Lecture Notes in Computer Science 6370 158-175 In: Radio frequency identification: security and privacy issues : 6th International Workshop, RFIDSec 2010, Istanbul, Turkey, June 8 - 9, 2010; revised selected papers (2010) Berlin [u.a.] RFIDSec 2010 (Istanbul, Turkey) [Konferenzveröffentlichung]

Liu, Yali ; Ghosal, Dipak ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Sadeghi, Ahmad-Reza ; Schulz, Steffen ; Katzenbeisser, Stefan Robust and undetectable steganographic timing channels for i.i.d. traffic. Böhme, Rainer Lecture Notes in Computer Science 6387 193-207 In: Information hiding : 12th International Conference, IH 2010, Calgary, AB, Canada, June 28 - 30, 2010; revised selected papers (2010) Berlin [u.a.] IH 2010 (Calgary, AB, Canada) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Sadeghi, Ahmad-Reza ; Visconti, Ivan ; Wachsmann, Christian On RFID privacy with mutual authentication and tag corruption. Zhou, Jianying Lecture Notes in Computer Science 6123 493-510 In: Applied cryptography and network security : 8th International Conference, ACNS 2010, Beijing, China, June 22 - 25, 2010; proceedings (2010) Berlin [u.a.] ACNS 2010 (Beijing, China) [Konferenzveröffentlichung]

Krause, Matthias ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Fleischmann, Ewan (2010) Preimage resistance beyond the birthday bound: Double-length hashing revisited. Cryptology ePrint Archive Santa Barbara, CA Report 2010/519 [Arbeitspapier]

Vorschau

Krause, Matthias ; Wegener, Ingo (2010) Circuit complexity. Crama, Yves ; Hammer, Peter L. Boolean models and methods in mathematics, computer science, and engineering Encyclopedia of Mathematics and its Applications Cambridge [u.a.] 134 506-530 [Buchkapitel]

2009

Krause, Matthias ; Stegemann, Dirk More on the Security of Linear RFID Authentication Protocols. Jacobson, Michael J. Lecture Notes in Computer Science 5867 182-196 In: Selected areas in cryptography : 16th International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13 - 14, 2009; revised selected paper (2009) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Stegemann, Dirk Algebraic Attacks against Linear RFID Authentication Protocols. Dagstuhl Seminar Proceedings 09031 No. 9 (2009) Wadern [Konferenzveröffentlichung]

Polzin, Tobias ; Vahdati Daneshmand, Siavash (2009) Approaches to the Steiner Problem in Networks. Lerner, Jürgen Algorithmics of Large and Complex Networks : Design, Analysis, and Simulation Berlin [u.a.] 81-103 [Buchkapitel]

2008

Tatli, Emin Islam (2008) Security in Context-aware Mobile Business Applications. None [Dissertation]

Vorschau

Guetat, Amel (2008) Real Time Rendering of Deformable and Semi-Transparent Objects by Volume Rendering. None Mannheim [Dissertation]

Vorschau

Becherer, Nico (2008) Simulation von Herzkatheterinterventionen bei Kleinkindern. None Mannheim [Dissertation]

Vorschau

2007

Stegemann, Dirk Extended BDD-based Cryptanalysis of Keystream Generators. Adams, Carlisle Lecture Notes in Computer Science 4876 17-35 In: Selected areas in cryptography : 14th International Workshop, SAC 2007, Ottawa, Canada, August 16 - 17, 2007; revised selected papers (2007) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias (2007) OBDD-based cryptanalysis of oblivious keystream generators. Theory of Computing Systems New York, NY [u.a.] 40 1 101-121 [Zeitschriftenartikel]

2006

Armknecht, Frederik ORCID: 0009-0003-9935-8095 (2006) Algebraic attacks on certain stream ciphers. None Mannheim [Dissertation]

Vorschau

Polzin, Tobias ; Vahdati Daneshmand, Siavash Practical partitioning-based methods for the Steiner problem. Àlvarez, Carme Lecture Notes in Computer Science 4007 241-252 In: Experimental algorithms : 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24 - 27, 2006; proceedings (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Stegemann, Dirk Reducing the Space Complexity of BDD-based Attacks on Keystream Generators. Robshaw, Matthew Fast Software Encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 - 17, 2006; revised selected papers 4047 163-178 In: Fast software encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 - 17, 2006; revised selected papers (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Tatli, Emin Islam (2006) Privacy in Context-aware Mobile Business Applications. Mannheim [Arbeitspapier]

Tatli, Emin Islam (2006) Context Data Model for Privacy. Mannheim [Arbeitspapier]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Carlet, Claude ; Gaborit, Philippe ; Künzli, Simon ; Meier, Willi ; Ruatta, Olivier Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. Vaudenay, Serge Lecture Notes in Computer Science 4004 147-164 In: Advances in cryptology - EUROCRYPT 2006 : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006; proceedings (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Brandeis, Jörg ; Ilinykh, Egor Experimental Results on Algebraic Attacks on Stream Ciphers. Dittmann, Jana GI-Edition : Lecture Notes in Informatics. Proceedings 77 279-282 In: Sicherheit 2006 : Haupttagung "Sicherheit - Schutz und Zuverlässigkeit"; Workshop "Qualifizierte elektronische Signaturen in Theorie und Praxis" (QSIG 2006); Otto-von-Guericke-Universität Magdeburg, 20. - 22. Februar 2006 (2006) Bonn [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. Bugliesi, Michele Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 - 14, 2006; proceedings 2 180-191 In: Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 - 14, 2006; proceedings (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Kelsey, John ; Lucks, Stefan Collisions and Near-Collisions for Reduced-Round TIGER. Robshaw, Matthew Lecture Notes in Computer Science 4047 111-125 In: Fast software encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 - 17, 2006; revised selected papers (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan Cryptographic Hash Functions : Recent Results on Cryptanalysis and their Implications on Systems Security. SANE 2006 : 5th System Administration and Network Engineering Conference, May 15-19, 2006, Delft, The Netherlands 1-19 In: Proceedings SANE 2006 : May 15-19, 2006, Delft, The Netherlands (2006) [Delft] [Konferenzveröffentlichung]

Krause, Matthias (2006) On the computational power of Boolean decision lists. Computational Complexity : CC Cham 14 4 362-375 [Zeitschriftenartikel]

Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Abstracts collection - Complexity of Boolean functions. Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Dagstuhl Seminar Proceedings 6111 1 In: Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03. - 17.03.2006 (2006) Wadern Complexity of Boolean Functions (Dagstuhl, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Melkebeek, Dieter van ; Pudlák, Pavel ; Reischuk, Rüdiger Executive Summary of the Dagstuhl Seminar 06111 "Complexity of Boolean Functions". Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Dagstuhl Seminar Proceedings 6111 1-5 In: Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03 - 17.03.2006 (2006) Wadern Complexity of Boolean Functions (Dagstuhl, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van (2006) Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings Wadern 6111 [Buch]

2005

Lucks, Stefan A Failure-Friendly Design Principle for Hash Functions. Roy, Bimal Lecture Notes in Computer Science 3788 474-494 In: Advances in cryptology - ASIACRYPT 2005 : 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India; proceedings (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 Algebraic Attacks and Annihilators. Wolf, Christopher GI-Edition : Lecture Notes in Informatics. Proceedings 74 13-21 In: WEWoRC 2005 : Western European Workshop on Research in Cryptology; in Leuven, Belgium (2005) Bonn [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias ; Stegemann, Dirk Design Principles for Combiners with Memory. Maitra, Subhamoy Lecture Notes in Computer Science 3797 104-117 In: Progress in cryptology - INDOCRYPT 2005 : 6th International Conference on Cryptology in India, Bangalore, India; proceedings (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan ; Zenner, Erik ; Weimerskirch, Andre Entity Recognition for Sensor Network Motes. Cremers, Armin B. Informatik 2005 : 35th Annual Conference of the Gesellschaft für Informatik e.V., Bonn, 19.-22.9. 2005 2 145-149 In: Informatik 2005 : 35th Annual Conference of the Gesellschaft für Informatik e.V., Bonn, 19.-22.9. 2005 (2005) Bonn [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Meier, Willi Fault attacks on combiners with memory. Preneel, Bart Lecture Notes in Computer Science 3897 36-50 In: Selected Areas in Cryptography : 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11 - 12, 2005 ; revised selected papers (2005) Berlin [u.a.] SAC 2005 (Kingston, ON) [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan (2005) Hashfunktionen gebrochen. Datenschutz und Datensicherheit : DuD Wiesbaden 29 4 1-4 [Zeitschriftenartikel]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Ars, Gwénolé Introducing a new variant of fast algebraic attacks and minimizing their successive data complexity. Dawson, Ed ; Vaudenay, Serge Lecture Notes in Computer Science 3715 16-32 In: Progress in Cryptology - MYCRYPT 2005 : First International Conference on Cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28 - 30, 2005; proceedings (2005) Berlin [u.a.] Mycrypt 2005 (Kuala Lumpur, Malaysia) [Konferenzveröffentlichung]

Lucks, Stefan ; Schmoigl, Nico ; Tatli, Emin Islam Issues on Designing a Cryptographic Compiler. Wolf, Christopher GI-Edition : Lecture Notes in Informatics. Proceedings 74 109-122 In: WEWoRC 2005 : Western European Workshop on Research in Cryptology; July 5 - 7, 2005, in Leuven, Belgium (2005) Bonn [Konferenzveröffentlichung]

Kühn, Ulrich ; Kursawe, Klaus ; Lucks, Stefan ; Saghedi, Ahmed-Reza ; Stüble, Christian Secure Data Management in Trusted Computing. Rao, Josyula R. Lecture Notes in Computer Science 3659 324-338 In: Cryptographic Hardware and Embedded Systems - CHES 2005 : 7th International Workshop, Edinburgh, UK, August 29 - September 1, 2005; proceedings (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Tatli, Emin Islam ; Stegemann, Dirk ; Lucks, Stefan Security Challenges of Location-Aware Mobile Business. Werner, Bob Proceedings / 2nd IEEE International Workshop on Mobile Commerce and Services (WMCS '05), July 19, 2005, Munich, Germany 84-93 In: Proceedings / 2nd IEEE International Workshop on Mobile Commerce and Services (WMCS '05), July 19, 2005, Munich, Germany (2005) Los Alamitos, Calif. [Konferenzveröffentlichung]

Lucks, Stefan Two-Pass Authenticated Encryption Faster Than Generic Composition. Gilbert, Henri Lecture Notes in Computer Science 3557 284-298 In: Fast Software Encryption : 12th International Workshop, FSE 2005, Paris, France, February 21 - 23, 2005; revised selected papers (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Wolf, Christopher ; Lucks, Stefan ; Yau, Po-Wah (2005) WEWoRC 2005 : Western European Workshop on Research in Cryptology; July 5 - 7, 2005, in Leuven, Belgium. GI-Edition : Lecture Notes in Informatics. Proceedings Bonn 74 [Buch]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Lano, Joseph ; Preneel, Bart Extending the resynchronization attack. Handschuh, Helena ; Hasan, M. Anwar Lecture Notes in Computer Science 3357 19-38 In: Selected areas in cryptography : 11th International Workshop, SAC 2004, Waterloo, Canada, August 9 - 10, 2004; revised selected papers (2005) Berlin [u.a.] SAC'04 (Waterloo, Canada) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Lucks, Stefan Linearity of the AES Key Schedule. Dobbertin, Hans Lecture Notes in Computer Science 3373 159-169 In: Advanced encryption standard - AES : 4th International Conference, AES 2004, Bonn, Germany, May 10 - 12, 2004; revised selected and invited papers (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Beller, Michael (2005) Ein intuitives Verfahren zur adaptiven merkmalsgestützten Segmentierung. None Mannheim [Dissertation]

Vorschau

Krause, Matthias ; Savický, Petr ; Wegener, Ingo (2005) On the influence of the variable ordering for algorithmic learning using OBDDs. Information and Computation Amsterdam 201 2 160-177 [Zeitschriftenartikel]

2004

Vahdati Daneshmand, Siavash (2004) Algorithmic Approaches to the Steiner Problem in Networks. None [Dissertation]

Vorschau

Zenner, Erik (2004) On Cryptographic Properties of LFSR-based Pseudorandom Generators. None [Dissertation]

Vorschau

Armknecht, Frederik ORCID: 0009-0003-9935-8095 Algebraic Attacks on Stream Ciphers. Neittaanmäki, Pekka Proceedings / ECCOMAS 2004 : July 24 - 28 2004, Jyväskylä, Finland; 4th European Congress on Computational Methods in Applied Sciences and Engineering In: Proceedings / ECCOMAS 2004, 4th European Congress on Computational Methods in Applied Sciences and Engineering : Jyväskylä, Finland, 24 - 28 July 2004 (2004) Jyväskylä [Konferenzveröffentlichung]

Lucks, Stefan Ciphers Secure against Related Key Attacks. Roy, Bimal Lecture Notes in Computer Science 3017 359-370 In: Fast Software Encryption : 11th International Workshop, FSE 2004, Delhi, India, February 5 - 7, 2004; revised papers (2004) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 Improving Fast Algebraic Attacks. Roy, Bimal Lecture Notes in Computer Science 3017 65-82 In: Fast Software Encryption : 11th International Workshop, FSE 2004, Delhi, India, February 5 - 7, 2004; revised papers (2004) Berlin [u.a.] [Konferenzveröffentlichung]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (2004) On relations between counting communication complexity classes. Journal of Computer and System Sciences : JCSS San Diego, CA [u.a.] 69 2 259-280 [Zeitschriftenartikel]

2003

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Algebraic attacks on combiners with memory. Boneh, Dan Lecture Notes in Computer Science 2729 162-175 In: Advances in cryptology - CRYPTO 2003 : 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17 - 21, 2003; proceedings (2003) Berlin [u.a.] CRYPTO 2003 (Santa Barbara, CA) [Konferenzveröffentlichung]

Lucks, Stefan ; Zenner, Erik (2003) Kryptographie - Eine Geheimwissenschaft wird öffentlich. Forum : Forschung Uni Mannheim Mannheim 14-17 [Zeitschriftenartikel]

Ferguson, Niels ; Whiting, Doug ; Schneier, Bruce ; Kelsey, John ; Lucks, Stefan ; Kohno, Tadayoshi Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive. Johansson, Thomas Lecture Notes in Computer Science 2887 330-346 In: Fast software encryption : 10th International Workshop, FSE 2003, Lund, Sweden, February 24 - 26, 2003; revised papers (2003) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan ; Weis, Rüdiger How to turn a PIN into an Iron Beam: A patent-free and practical protocol for secure communication using a weak common secret. Gritzalis, Dimitris IFIP Conference Proceedings 250 385-396 In: Security and Privacy in the Age of Uncertainty : IFIP TC11 18th International Conference on Information Security (SEC2003), May 26-28, 2003, Athens, Greece (2003) Boston, Mass. [u.a.] [Konferenzveröffentlichung]

Daneshmand, Siavash Vahdati ; Althaus, Ernst ; Polzin, Tobias Improving Linear Programming Approaches for the Steiner Tree Problem. Jansen, Klaus Lecture Notes in Computer Science 2647 1-14 In: Experimental and efficient algorithms : second international workshop ; proceedings / WEA 2003, Ascona, Switzerland, May 26 - 28, 2003 (2003) Berlin [u.a.] [Konferenzveröffentlichung]

Daneshmand, Siavash Vahdati ; Polzin, Tobias (2003) On Steiner Trees and Minimum Spanning Trees in Hypergraphs. Operations Research Letters Amsterdam [u.a.] 31 1 12-20 [Zeitschriftenartikel]

Lucks, Stefan ; Bogk, Andreas ; Weis, Rüdiger (2003) Sicherheit von 1024bit RSA Schlüsseln gefährdet. Datenschutz und Datensicherheit : DuD Wiesbaden 27 6 360 [Zeitschriftenartikel]

Krause, Matthias ; Simon, Hans Ulrich (2003) Determining the optimal contrast for secret sharing schemes in visual cryptography. Combinatorics, Probability & Computing : CPC Cambridge 12 3 285-299 [Zeitschriftenartikel]

2002

Armknecht, Frederik ORCID: 0009-0003-9935-8095 (2002) A Linearization Attack on the Bluetooth Key Stream Generator. Cryptology ePrint Archive Santa Barbara, CA Report 2002/191 [Arbeitspapier]

Lucks, Stefan A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order. Zheng, Yuliang Lecture Notes in Computer Science 2501 27-45 In: Advances in cryptology - ASIACRYPT 2002 : 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1 - 5, 2002; proceedings (2002) Berlin [u.a.] [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan "All your key bit are belong to us" the true story of black box cryptography. MAGAZIN OF USENIX & SAGE In: 3rd International SANE Conference May 27 - 31, 2002 MECC, Maastricht, The Netherlands (2002) Amerongen [Konferenzveröffentlichung]

Krause, Matthias BDD-based Cryptanalysis of Keystream Generators. Knudsen, Lars Lecture Notes in Computer Science 2332 222-237 In: Advances in cryptology - EUROCRYPT 2002 : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002; proceedings (2002) Berlin [u.a.] [Konferenzveröffentlichung]

Polzin, Tobias ; Vahdati Daneshmand, Siavash Extending Reduction Techniques for the Steiner Tree Problem. Möhring, Rolf Lecture Notes in Computer Science 2461 795-807 In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002; proceedings (2002) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan ; Weis, Rüdiger (2002) Neue Ergebnisse zur Sicherheit des Verschlüsselungsstandards AES. Datenschutz und Datensicherheit : DuD Wiesbaden 26 12 748-751 [Zeitschriftenartikel]

Krause, Matthias On the Computational Power of Boolean Decision Lists. Alt, Helmut STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes- Juan les Pins, France, March 14 - 16, 2002; proceedings 372-383 In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes- Juan les Pins, France, March 14 - 16, 2002; proceedings (2002) Berlin [Konferenzveröffentlichung]

Zenner, Erik On the Efficiency of the Clock Control Guessing Attack. Lee, Pil Joong Lecture Notes in Computer Science 2587 200-212 In: Information security and cryptology - ICISC 2002 : 5th International Conference, Seoul, Korea, November 28 - 29, 2002; revised papers (2002) Berlin [u.a.] [Konferenzveröffentlichung]

Janzing, Dominik ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Zeier, Robe ; Beth, Thomas (2002) Quantum control without access to the controlling interaction. Physical Review / A Melville, NY 65 2 022104, 1-8 [Zeitschriftenartikel]

2001

Crowley, Paul ; Lucks, Stefan Bias in the Leviathan Stream cipher. Matsui, Mitsuru Lecture Notes in Computer Science 2355 211-218 In: Fast software encryption : 8th International Workshop, FSE 2001, Yokohama, Japan, April 2 - 4, 2001; revised papers (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Ferguson, Niels ; Kelsey, John ; Lucks, Stefan ; Schneier, Bruce ; Stay, Mike ; Wagner, David ; Whiting, Doug Improved Cryptanalysis of Rijndael. Schneier, Bruce Lecture Notes in Computer Science 1978 213-230 In: Fast software encryption : 7th International Workshop, FSE 2000, New York, NY, USA, April 10 -12, 2000; proceedings (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Zenner, Erik ; Krause, Matthias ; Lucks, Stefan Improved Cryptanalysis of the Self-Shrinking Generator. Varadharajan, Vijay Lecture Notes in Computer Science 2119 21-35 In: Information security and privacy : 6th Australasian Conference, ACISP 2001, Sydney, Australia, July 11 - 13, 2001; proceedings (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Lucks, Stefan On the Minimal Hardware Complexity of Pseudorandom Function Generators. Ferreira, Afonso Lecture Notes in Computer Science 2010 419-430 In: Proceedings STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15 - 17, 2001 (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan The Saturation Attack - a Bait for Twofish. Matsui, Mitsuru Lecture Notes in Computer Science 2355 1-15 In: Fast software encryption : 8th International Workshop, FSE 2001, Yokohama, Japan, April 2 - 4, 2001; revised papers (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Forster, Jürgen ; Krause, Matthias ; Lokam, Satyanarayana V. ; Mubarakzjanov, Rustam ; Schmitt, Niels ; Simon, Hans Ulrich Relations between communication complexity, linear arrangements, and computational complexity. Hariharan, Ramesh ; Vinay, V. ; Mukund, Madhavan Lecture Notes in Computer Science 2245 171-182 In: FST TCS 2001: Foundations of software technology and theoretical computer science : 21st Conference, Bangalore, India, December 13–15, 2001, proceedings (2001) Berlin [u.a.] FST TCS 2001 (Bangaluru, India) [Konferenzveröffentlichung]

Krause, Matthias ; Lucks, Stefan (2001) Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. Computational Complexity : CC Cham 10 4 297-313 [Zeitschriftenartikel]

Krause, Matthias (2001) BDD-based cryptanalysis of keystream generators. Cryptology ePrint Archive Santa Barbara, CA Report 2001/092 [Arbeitspapier]

2000

Polzin, Tobias ; Vahdati Daneshmand, Siavash (2000) A Comparison of Steiner Tree Relaxations. Discrete Applied Mathematics : DAM Amsterdam [u.a.] 11 241-261 [Zeitschriftenartikel]

Lucks, Stefan Attacking Seven Rounds of Rijndael under 192-bit and 256-bit Keys. Foti, Jim AES3 : The Third Advanced Encryption Standard Candidate Conference 215-229 In: The Third Advanced Encryption Standard Candidate Conference : AES 3; April 13-14 2000, New York, NY (2000) Gaithersburg, Md. [Konferenzveröffentlichung]

Lucks, Stefan ; Weis, Rüdiger How to make DES-based smartcards fit for the 21-st century. Domingo-Ferrer, Josep IFIP International Federation for Information Processing 52 93-114 In: Smart card research and advanced applications : IFIP TC8/WG8.8 Fourth Working Conference on Smart Card Research and Advanced Applications, September 20-22, 2000, Bristol, United Kingdom (2000) Boston, Mass. [u.a.] [Konferenzveröffentlichung]

Bakker, Bastiaan ; Weis, Rüdiger ; Lucks, Stefan How to Ring a Swan: Adding Tamper Resistant Authentication to Linux IPSec. SANE 2000 -- 2nd International System Administration and Networking Conference 31-62 In: Proceedings / SANE 2000 : May 22 - 25, 2000, Maastricht, The Netherlands / [2nd International System Administration and Networking Conference] (2000) Amsterdam [Konferenzveröffentlichung]

Polzin, Tobias ; Vahdati Daneshmand, Siavash (2000) Improved Algorithms for the Steiner Problem in Networks. Discrete Applied Mathematics : DAM 11 263-300 [Zeitschriftenartikel]

Krause, Matthias ; Simon, Hans Ulrich Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. Gonnet, Gastón H. Lecture Notes in Computer Science 1776 280-291 In: LATIN 2000: Theoretical informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10 - 14, 2000; proceedings (2000) Berlin [u.a.] [Konferenzveröffentlichung]

Weis, Rüdiger ; Effelsberg, Wolfgang ; Lucks, Stefan Remotely Keyed Encryption with Java Cards : A Secure and Efficient Method to Encrypt Multimedia Streams. IEEE International Conference on Multimedia and Expo (ICME 2000) 1 537-540 In: Proceedings : [latest advances in the fast changing world of multimedia] ; 30 July - 2 August 2000, New York, NY USA (2000) Piscataway, NJ [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan The Performance of Modern Block Ciphers in JAVA. Quisquater, Jean-Jacqques Lecture Notes in Computer Science 1820 125-133 In: Smart card research and applications : Third International Conference, CARDIS '98, Louvain-la-Neuve, Belgium, September 14 - 16, 1998; proceedings (2000) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan The Sum of PRPs is a Secure PRF. Preneel, Bart Lecture Notes in Computer Science 1807 470-484 In: Advances in cryptology : proceedings / EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14 - 18, 2000 (2000) Berlin [u.a.] [Konferenzveröffentlichung]

Hofmeister, Thomas ; Krause, Matthias ; Simon, Hans Ulrich (2000) Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theoretical Computer Science Amsterdam [u.a.] 240 2 471-485 [Zeitschriftenartikel]

Krause, Matthias ; Simon, Hans Ulrich (2000) Determining the optimal contrast for secret sharing schemes in visual cryptography. Electronic Colloquium on Computational Complexity : ECCC Trier TR00-003 [Arbeitspapier]

Krause, Matthias ; Lucks, Stefan (2000) On learning versus distinguishing and the minimal hardware complexity of pseudorandom function generators. Electronic Colloquium on Computational Complexity : ECCC Trier TR00-014 [Arbeitspapier]

1999

Lucks, Stefan Accelerated Remotely Key Encryption. Knudsen, Lars Lecture Notes in Computer Science 1636 112-123 In: Fast Software Encyption : 6th International Workshop, FSE '99, Rome, Italy, March 24 - 26, 1999; proceedings (1999) Berlin [u.a.] [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan (1999) Advanced Encryption Standard : Verschlüsselungsstandard für das einundzwanzigste Jahrhundert. Datenschutz und Datensicherheit : DuD Wiesbaden 23 10 [Zeitschriftenartikel]

Krause, Matthias ; Savický, Petr ; Wegener, Ingo Approximations by OBDDs and the variable ordering problem. Wiedermann, Jiri Lecture Notes in Computer Science 1644 Nr.164 493-502 In: Automata, languages and programming : 26th International Colloquium, ICALP '99, Prague, Czech Republik, July 11 - 15, 1999; proceedings (1999) Berlin [u.a.] [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan Fast Multimedia Encryption in JAVA : Using Unbalanced Luby/Rackoff Ciphers. Leopold, Helmut Lecture Notes in Computer Science 1629 456-471 In: Multimedia applications, services and techniques - ECMAST '99 : 4th European conference, Madrid, Spain, May 26 - 28, 1999; proceedings (1999) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan On the Security of the 128-Bit Block Cipher DEAL. Knudsen, Lars Lecture Notes in Computer Science 1636 60-70 In: Fast software encryption : 6th International Workshop, FSE '99, Rome, Italy, March 24 - 26, 1999; proceedings (1999) Berlin [u.a.] [Konferenzveröffentlichung]

Lucks, Stefan ; Weis, Rüdiger Remotely Keyed Encryption Using Non-Encrypting Smart Cards. USENIX Workshop on Smartcard Technology 1-6 In: Proceedings of the USENIX Workshop on Smartcard Technology (Smartcard '99) : May 10-11,1999, Chicago, Illinois, USA (1999) Berkeley, Calif. [Konferenzveröffentlichung]

Weis, Rüdiger ; Lucks, Stefan (1999) Sichere, standardisierte, symmetrische Verschlüsselung auf Basis von DES und AES. Praxis der Informationsverarbeitung und Kommunikation : PIK Berlin 22 4 226-232 [Zeitschriftenartikel]

Krause, Matthias ; Savický, Petr ; Wegener, Ingo (1999) Approximations by OBDDs and the variable ordering problem. Electronic Colloquium on Computational Complexity : ECCC Trier TR99-011 [Arbeitspapier]

1998

Lucks, Stefan Attacking Triple Encryption. Vaudenay, Serge Lecture Notes in Computer Science 1372 239-253 In: Fast software encryption : 5th international workshop, FSE'98, Paris, France, March 23 - 25, 1998; proceedings (1998) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel (1998) Computing Boolean functions by polynomials and threshold circuits. Computational Complexity Berlin [u.a.] 7 4 346-370 [Zeitschriftenartikel]

Weis, Rüdiger ; Lucks, Stefan (1998) KEA. Datenschutz und Datensicherheit : DuD Wiesbaden 22 10 [Zeitschriftenartikel]

Weis, Rüdiger ; Lucks, Stefan (1998) Sicherheitsprobleme bei Authentifizierung und Verschlüsselung in GSM-Netzen. Datenschutz und Datensicherheit : DuD Wiesbaden 22 9 504-508 [Zeitschriftenartikel]

1997

Krause, Matthias ; Simon, Hans Ulrich ; Hofmeister, Thomas Contrast-optimal k out of n secret sharing schemes in visual cryptography. Jiang, Tao Lecture Notes in Computer Science 1276 176-185 In: Computing and combinatorics : third Annual International Conference COCOON '97, Shanghai, China, August 20-22, 1997; proceedings (1997) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel (1997) On the computational power of depth 2 circuits with threshold and modulo gates. Theoretical Computer Science Amsterdam [u.a.] 174 1/2 137-156 [Zeitschriftenartikel]

1996

Krause, Matthias (1996) Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science Amsterdam [u.a.] 156 1/2 99-117 [Zeitschriftenartikel]

1995

Krause, Matthias (1995) A note on realizing iterated multiplication by small depth threshold circuits. Electronic Colloquium on Computational Complexity : ECCC Trier TR95-009 [Arbeitspapier]

Krause, Matthias On realizing iterated multiplication by small depth threshold circuits. Mayr, Ernst W. ; Puech, Claude Lecture Notes in Computer Science 900 83-94 In: STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, proceedings (1995) Berlin [u.a.] STACS 95 (München, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel On computing Boolean functions by sparse real polynomials. Raghavan, Prabhakar 682-691 In: 36th Annual Symposium on Foundations of Computer Science : October 23 - 25, 1995, Milwaukee, Wisconsin, proceedings (1995) Los Alamitos, CA [u.a.] FOCS 1995 (Milwaukee, WI) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan (1995) Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in. Mathematical Systems Theory New York, NY [u.a.] 28 6 553-564 [Zeitschriftenartikel]

1994

Krause, Matthias ; Pudlák, Pavel (1994) On the computational power of depth 2 circuits with threshold and modulo gates. Electronic Colloquium on Computational Complexity : ECCC Trier TR94-023 [Arbeitspapier]

Nissen, Volker ; Krause, Matthias Constrained combinatorial optimization with an evolution strategy. Reusch, Bernd 33-40 In: Fuzzy Logik : Theorie und Praxis, 4. Dortmunder Fuzzy-Tage, Dortmund, 6.-8. Juni 1994 (1994) Berlin ; Heidelberg [u.a.] 4. Dortmunder Fuzzy-Tage (Dortmund, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel On the computational power of depth 2 circuits with threshold and modulo gates. Leighton, F. Tom ; Goodrich, Michael 48-57 In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing : Montréal, Québec, Canada, May 23 - 25, 1994 (1994) New York, NY STOC '94 (Montreal, QC) [Konferenzveröffentlichung]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1994) Separating oblivious linear length MODp-branching program classes. Journal of Information Processing and Cybernetics Giessen 30 2 63-75 [Zeitschriftenartikel]

1993

Krause, Matthias (1993) Zur Berechnung Boolescher Funktionen durch Branching Programme und Schaltkreise kleiner Tiefe. Dortmund [Habilitation]

1992

Hromkovič, Juraj ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuits. Information and Computation Amsterdam [u.a.] 96 2 168-178 [Zeitschriftenartikel]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating counting communication complexity classes. Finkel, Alain ; Jantzen, Matthias Lecture Notes in Computer Science 577 279-292 In: STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13 - 15, 1992, proceedings (1992) Berlin [u.a.] STACS 92 (Cachan, France) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. RAIRO. Theoretical Informatics and Applications Les Ulis 26 4 345-362 [Zeitschriftenartikel]

Krause, Matthias (1992) Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access. RAIRO. Theoretical Informatics and Applications Les Ulis 26 6 507-522 [Zeitschriftenartikel]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating counting communication complexity classes. Forschungsbericht / Universität Trier, Mathematik, Informatik Trier 92-01 [Arbeitspapier]

1991

Krause, Matthias ; Waack, Stephan (1991) On oblivious branching programs of linear length. Information and Computation Amsterdam [u.a.] 94 2 232-249 [Zeitschriftenartikel]

Krause, Matthias (1991) Lower bounds for depth-restricted branching programs. Information and Computation Amsterdam [u.a.] 91 1 1-14 [Zeitschriftenartikel]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1991) Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science Amsterdam [u.a.] 86 2 267-275 [Zeitschriftenartikel]

Krause, Matthias Geometric arguments yield better bounds for threshold circuits and distributed computing. 314-321 In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, June 30 - July 3, 1991, University of Chicago, Chicago, Illinois (1991) Los Alamitos, CA [u.a.] 6th Annual Structure in Complexity Theory Conference (Chicago, IL) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in. Sipser, Michael 1 777-782 In: 32nd Annual Symposium on Foundations of Computer Science : San Juan, Puerto Rico, October 1 - 4, 1991, proceedings (1991) Los Alamitos, CA [u.a.] FOCS 1991 (San Juan, Puerto Rico) [Konferenzveröffentlichung]

1990

Krause, Matthias Separating ⊕L from L, NL, co-NL and AL (=P) for oblivious turing machines of linear access time. Rovan, Branislav Lecture Notes in Computer Science 452 385-391 In: Mathematical Foundations of Computer Science 1990 : Banská Bystrica, Czechoslovakia, August 27–31, 1990, proceedings (1990) Berlin [u.a.] MFCS 1990 (Banská Bystrica, Czechoslovakia) [Konferenzveröffentlichung]

1989

Krause, Matthias (1989) Untere Schranken für Berechnungen durch Verzweigungsprogramme. Berlin [Dissertation]

Krause, Matthias ; Waack, Stephan On oblivious branching programs of linear length. Csirik, János ; Demetrovics, János ; Gécseg, Ferenc Lecture Notes in Computer Science 380 287-296 In: Fundamentals of computation theory : International Conference FCT '89, Szeged, Hungary, August 21 - 25, 1989, proceedings (1989) Berlin [u.a.] FCT '89 (Szeged, Hungary) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Young, Paul 240-249 In: Structure in complexity theory : Fourth Annual Conference, June 19 - 22, 1989, University of Oregon, Eugene, Oregon, proceedings (1989) Washington, DC [u.a.] 4th Annual Conference on Structure in Complexity Theory (Eugene, OR) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to restricted logarithmic space-bounded Turing machines. Ritter, Gerhard X. IFIP congress series 11 287-292 In: Information Processing 89 : Proceedings of the IFIP 11th World Computer Congress, San Francisco, U.S.A., August 28 - September 1, 1989 (1989) Amsterdam [u.a.] IFIP '89 (San Francisco, CA) [Konferenzveröffentlichung]

1988

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating the eraser turing machine classes Le, NLe, co-NLe and Pe. Chytil, Michal P. ; Janiga, Ladislav ; Koubek, Václav Lecture Notes in Computer Science 324 405-413 In: Mathematical Foundations of Computer Science 1988 : proceedings of the 13th Symposium, Carlsbad, Czechoslovakia, August 29 – September 2, 1988 (1988) Berlin [u.a.] MFCS '88 (Carlsbad, Czechoslovakia) [Konferenzveröffentlichung]

Krause, Matthias (1988) Exponential lower bounds on the complexity of local and real-time branching programs. EIK : Journal of Information Processing and Cybernetics Giessen 24 3 99-110 [Zeitschriftenartikel]

1986

Krause, Matthias (1986) Exponentielle untere Schranken für one-time-only Branching Programme. Berlin [Abschlussarbeit]