×

zbMATH — the first resource for mathematics

Krause, Matthias

Compute Distance To:
Author ID: krause.matthias Recent zbMATH articles by "Krause, Matthias"
Published as: Krause; Krause, M.; Krause, Matthias
Documents Indexed: 48 Publications since 1902, including 2 Books

Publications by Year

Citations contained in zbMATH

38 Publications have been cited 197 times in 143 Documents Cited by Year
Algebraic attacks on combiners with memory. Zbl 1122.94346
Armknecht, Frederik; Krause, Matthias
17
2003
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0749.68036
Krause, Matthias; Meinel, Christoph; Waack, Stephan
17
1991
On the computational power of depth-2 circuits with threshold and modulo gates. Zbl 0908.68110
Krause, Matthias; Pudlák, Pavel
13
1997
BDD-based cryptanalysis of keystream generators. Zbl 1055.94018
Krause, Matthias
12
2002
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Zbl 0947.68048
Hofmeister, T.; Krause, M.; Simon, H. U.
11
2000
Relations between communication complexity, linear arrangements, and computational complexity. Zbl 1052.68051
Forster, Jürgen; Krause, Matthias; Lokam, Satyanarayana V.; Mubarakzjanov, Rustam; Schmitt, Niels; Simon, Hans Ulrich
10
2001
Computing Boolean functions by polynomials and threshold circuits. Zbl 0936.94022
Krause, Matthias; Pudlák, Pavel
10
1998
Lower bounds for depth-restricted branching programs. Zbl 0800.68495
Krause, Matthias
10
1991
On the computational power of depth 2 circuits with threshold and modulo gates. Zbl 1345.68130
Krause, Matthias; Pudlák, Pavel
8
1994
Exponential lower bounds on the complexity of local and real-time branching programs. Zbl 0668.68051
Krause, Matthias
8
1988
Constructing single- and multi-output Boolean functions with maximal algebraic immunity. Zbl 1133.94308
Armknecht, Frederik; Krause, Matthias
7
2006
On relations between counting communication complexity classes. Zbl 1159.68465
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
6
2004
Determining the optimal contrast for secret sharing schemes in visual cryptography. Zbl 1053.94015
Krause, Matthias; Simon, Hans Ulrich
6
2003
Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract). Zbl 0882.94021
Hofmeister, Thomas; Krause, Matthias; Simon, Hans U.
6
1997
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Zbl 0768.68017
Krause, Matthias; Meinel, Christoph; Waack, Stephan
6
1992
On oblivious branching programs of linear length. Zbl 0727.68038
Krause, Matthias; Waack, Stephan
6
1991
Geometric arguments yield better bounds for threshold circuits and distributed computing. Zbl 0887.68034
Krause, Matthias
5
1996
The preimage security of double-block-length compression functions. Zbl 1227.94026
Armknecht, Frederik; Fleischmann, Ewan; Krause, Matthias; Lee, Jooyoung; Stam, Martijn; Steinberger, John
4
2011
On the computational power of Boolean decision lists. Zbl 1105.68043
Krause, Matthias
4
2005
Design and analysis of small-state grain-like stream ciphers. Zbl 1390.94840
Hamann, Matthias; Krause, Matthias; Meier, Willi; Zhang, Bin
3
2018
Reducing the space complexity of BDD-based attacks on keystream generators. Zbl 1234.68093
Krause, Matthias; Stegemann, Dirk
3
2006
Improved cryptanalysis of the self-shrinking generator. Zbl 1005.94533
Zenner, Erik; Krause, Matthias; Lucks, Stefan
3
2001
Separating \(\oplus{}L\), from \(L\), \(NL\), co-\(NL\), and \(AL=P\) for oblivious turing machines of linear access. Zbl 0766.68042
Krause, Matthias
3
1992
Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds. Zbl 1039.68053
Krause, Matthias; Lucks, Stefan
2
2001
Fredholm theory of interpolation morphisms. Zbl 0906.47012
Krause, M.
2
1998
Separating \(\oplus L\) form L, NL, co-NL and AL \((=P)\) for oblivious Turing machines of linear access time. Zbl 0733.68032
Krause, Matthias
2
1990
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits. Zbl 0674.68033
Hromkovič, Juraj; Krause, Matthias; Meinel, Christoph; Waack, Stephan
2
1990
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Zbl 1390.94839
Hamann, Matthias; Krause, Matthias
1
2018
The cryptographic power of random selection. Zbl 1292.94096
Krause, Matthias; Hamann, Matthias
1
2012
Circuit complexity. Zbl 1208.94074
Krause, Matthias; Wegener, Ingo
1
2010
More on the security of linear RFID authentication protocols. Zbl 1267.94077
Krause, Matthias; Stegemann, Dirk
1
2009
Design principles for combiners with memory. Zbl 1153.94344
Armknecht, Frederik; Krause, Matthias; Stegemann, Dirk
1
2005
On the computational power of Boolean decision lists. Zbl 1054.68066
Krause, Matthias
1
2002
On the minimal hardware complexity of pseudorandom function generators. Zbl 0981.68711
Krause, Matthias; Lucks, Stefan
1
2001
On extremal perturbations of semi-Fredholm operators. Zbl 0864.47003
Förster, K.-H.; Krause, M.
1
1996
Separating oblivious linear length \(\text{MOD}_ p\)-branching program classes. Zbl 0838.68037
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1994
On oblivious branching programs of linear length. Zbl 0756.68042
Krause, Matthias; Waack, Stephan
1
1989
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0656.68050
Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1988
Design and analysis of small-state grain-like stream ciphers. Zbl 1390.94840
Hamann, Matthias; Krause, Matthias; Meier, Willi; Zhang, Bin
3
2018
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Zbl 1390.94839
Hamann, Matthias; Krause, Matthias
1
2018
The cryptographic power of random selection. Zbl 1292.94096
Krause, Matthias; Hamann, Matthias
1
2012
The preimage security of double-block-length compression functions. Zbl 1227.94026
Armknecht, Frederik; Fleischmann, Ewan; Krause, Matthias; Lee, Jooyoung; Stam, Martijn; Steinberger, John
4
2011
Circuit complexity. Zbl 1208.94074
Krause, Matthias; Wegener, Ingo
1
2010
More on the security of linear RFID authentication protocols. Zbl 1267.94077
Krause, Matthias; Stegemann, Dirk
1
2009
Constructing single- and multi-output Boolean functions with maximal algebraic immunity. Zbl 1133.94308
Armknecht, Frederik; Krause, Matthias
7
2006
Reducing the space complexity of BDD-based attacks on keystream generators. Zbl 1234.68093
Krause, Matthias; Stegemann, Dirk
3
2006
On the computational power of Boolean decision lists. Zbl 1105.68043
Krause, Matthias
4
2005
Design principles for combiners with memory. Zbl 1153.94344
Armknecht, Frederik; Krause, Matthias; Stegemann, Dirk
1
2005
On relations between counting communication complexity classes. Zbl 1159.68465
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
6
2004
Algebraic attacks on combiners with memory. Zbl 1122.94346
Armknecht, Frederik; Krause, Matthias
17
2003
Determining the optimal contrast for secret sharing schemes in visual cryptography. Zbl 1053.94015
Krause, Matthias; Simon, Hans Ulrich
6
2003
BDD-based cryptanalysis of keystream generators. Zbl 1055.94018
Krause, Matthias
12
2002
On the computational power of Boolean decision lists. Zbl 1054.68066
Krause, Matthias
1
2002
Relations between communication complexity, linear arrangements, and computational complexity. Zbl 1052.68051
Forster, Jürgen; Krause, Matthias; Lokam, Satyanarayana V.; Mubarakzjanov, Rustam; Schmitt, Niels; Simon, Hans Ulrich
10
2001
Improved cryptanalysis of the self-shrinking generator. Zbl 1005.94533
Zenner, Erik; Krause, Matthias; Lucks, Stefan
3
2001
Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds. Zbl 1039.68053
Krause, Matthias; Lucks, Stefan
2
2001
On the minimal hardware complexity of pseudorandom function generators. Zbl 0981.68711
Krause, Matthias; Lucks, Stefan
1
2001
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Zbl 0947.68048
Hofmeister, T.; Krause, M.; Simon, H. U.
11
2000
Computing Boolean functions by polynomials and threshold circuits. Zbl 0936.94022
Krause, Matthias; Pudlák, Pavel
10
1998
Fredholm theory of interpolation morphisms. Zbl 0906.47012
Krause, M.
2
1998
On the computational power of depth-2 circuits with threshold and modulo gates. Zbl 0908.68110
Krause, Matthias; Pudlák, Pavel
13
1997
Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract). Zbl 0882.94021
Hofmeister, Thomas; Krause, Matthias; Simon, Hans U.
6
1997
Geometric arguments yield better bounds for threshold circuits and distributed computing. Zbl 0887.68034
Krause, Matthias
5
1996
On extremal perturbations of semi-Fredholm operators. Zbl 0864.47003
Förster, K.-H.; Krause, M.
1
1996
On the computational power of depth 2 circuits with threshold and modulo gates. Zbl 1345.68130
Krause, Matthias; Pudlák, Pavel
8
1994
Separating oblivious linear length \(\text{MOD}_ p\)-branching program classes. Zbl 0838.68037
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1994
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Zbl 0768.68017
Krause, Matthias; Meinel, Christoph; Waack, Stephan
6
1992
Separating \(\oplus{}L\), from \(L\), \(NL\), co-\(NL\), and \(AL=P\) for oblivious turing machines of linear access. Zbl 0766.68042
Krause, Matthias
3
1992
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0749.68036
Krause, Matthias; Meinel, Christoph; Waack, Stephan
17
1991
Lower bounds for depth-restricted branching programs. Zbl 0800.68495
Krause, Matthias
10
1991
On oblivious branching programs of linear length. Zbl 0727.68038
Krause, Matthias; Waack, Stephan
6
1991
Separating \(\oplus L\) form L, NL, co-NL and AL \((=P)\) for oblivious Turing machines of linear access time. Zbl 0733.68032
Krause, Matthias
2
1990
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits. Zbl 0674.68033
Hromkovič, Juraj; Krause, Matthias; Meinel, Christoph; Waack, Stephan
2
1990
On oblivious branching programs of linear length. Zbl 0756.68042
Krause, Matthias; Waack, Stephan
1
1989
Exponential lower bounds on the complexity of local and real-time branching programs. Zbl 0668.68051
Krause, Matthias
8
1988
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0656.68050
Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1988
all top 5

Cited by 211 Authors

12 Krause, Matthias
10 Waack, Stephan
8 Bollig, Beate
7 Sherstov, Alexander A.
6 Meinel, Christoph
5 De Santis, Alfredo
5 Sauerhoff, Martin
5 Sieling, Detlef
4 Damm, Carsten
4 Servedio, Rocco A.
4 Wegener, Ingo
3 Hamann, Matthias
3 Mennink, Bart
3 Moran, Shay
3 Podol’skiĭ, Vladimir Vladimirovich
3 Stănică, Pantelimon
3 Tan, Chik How
3 Wang, Qichun
3 Yehudayoff, Amir
3 Zhang, Bin
2 Arumugam, Subramanian
2 Blundo, Carlo
2 Brosenne, Henrik
2 Bshouty, Nader H.
2 Carlet, Claude
2 Chattopadhyay, Arkadev
2 Cimato, Stelvio
2 Feng, Dengguo
2 Feng, Keqin
2 Forster, Jürgen
2 Gál, Anna
2 Hansen, Kristoffer Arnsfelt
2 Homeister, Matthias
2 Hromkovič, Juraj
2 Jackson, Jeffrey C.
2 Lakshmanan, R.
2 O’Donnell, Ryan
2 Qi, Wenfeng
2 Razborov, Aleksandr Aleksandrovich
2 Simon, Hans-Ulrich
2 Viola, Emanuele
2 Williams, Richard Ryan
2 Wunderlich, Henning
2 Yukna, Stasys P.
1 Ada, Anil
1 Albrecht, Ernst
1 Alon, Noga M.
1 Andreeva, Elena Anatol’evna
1 Anthony, Martin H. G.
1 Ateniese, Giuseppe
1 Atıcı, Alp
1 Baev, V. V.
1 Beigel, Richard
1 Berbain, Côme
1 Bertram-Kretzberg, Claudia
1 Bogdanov, Andrej
1 Borghoff, Julia
1 Borodin, Allan B.
1 Bose, Mausumi
1 Breitbart, Yuri
1 Bun, Mark
1 Caballero-Gil, Pino
1 Chen, Huajin
1 Chen, Xiaosong
1 Cheraghi, Abbas
1 Chung, Jong H.
1 Chvátal, Vašek
1 Courtois, Nicolas T.
1 Davarzani, Mahmood
1 De Bonis, Annalisa
1 De Prisco, Roberto
1 Dey, Sabyasachi
1 Du, Jiao
1 Dubrova, Elena
1 Eibach, Tobias
1 Faenza, Yuri
1 Fang, Wen-Pinn
1 Fawzi, Omar
1 Feng, Xiutao
1 Ferrara, Anna Lisa
1 Fiorini, Samuel
1 Förster, Karl-Heinz
1 Fúster-Sabater, Amparo
1 Gainutdinova, Aida
1 Gilbert, Henri
1 Goldmann, Mikael
1 Goldsmith, Mark
1 Gong, Guang
1 Göös, Mika
1 Gouget, Aline
1 Grappe, Roland
1 Green, Frederic
1 Günther, Kerstin
1 Guo, Cheng
1 Hajiabolhassan, Hossein
1 Han, Daewan
1 Han, Huiting
1 Hell, Martin
1 Hellerstein, Lisa
1 Hu, Weitong
...and 111 more Authors

Citations by Year