Anzahl der Einträge: 78. Zeitschriftenartikel
Buch
Buchkapitel
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]
|
|
Dissertation
Konferenzveröffentlichung
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]
|
|
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]
|
|
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]
|
|
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]
|
|
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]
|
|
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 ; 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 ; 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]
|
|
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]
|
|
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]
|
|
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]
|
|
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]
|
|
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 ; 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]
|
|
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 ; 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]
|
|
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
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 ; 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
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 ; 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 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]
|
|
Arbeitspapier
Habilitation
Abschlussarbeit
Diese Liste wurde am Sat Aug 17 01:15:44 2024 CEST automatisch erstellt.
|