Matthias Krause

IACR Cryptol. ePrint Arch., 2019

Tight Security Bounds for Generic Stream Cipher Constructions.

[BibT_eX]

[DOI]

Alexander Moch

Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

2018

Design and analysis of small-state grain-like stream ciphers.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

2017

On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

A Note on Stream Ciphers that Continuously Use the IV.

[BibT_eX]

[DOI]

Willi Meier

IACR Cryptol. ePrint Arch., 2017

2016

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.

[BibT_eX]

[DOI]

Willi Meier

IACR Cryptol. ePrint Arch., 2016

2015

Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Hardware Efficient Authentication based on Random Selection.

[BibT_eX]

[DOI]

Proceedings of the Sicherheit 2014: Sicherheit, 2014

2013

Towards Search on Encrypted Graph Data.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Society, 2013

2011

The Cryptographic Power of Random Selection.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

The Preimage Security of Double-Block-Length Compression Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited.

[BibT_eX]

[DOI]

Ewan Fleischmann

IACR Cryptol. ePrint Arch., 2010

Circuit Complexity.

[BibT_eX]

[DOI]

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

More on the Security of Linear RFID Authentication Protocols.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

Algebraic Attacks against Linear RFID Authentication Protocols.

[BibT_eX]

[DOI]

Proceedings of the Symmetric Cryptography, 11.01. - 16.01.2009, 2009

2007

OBDD-Based Cryptanalysis of Oblivious Keystream Generators.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

2006

On the computational power of Boolean decision lists.

[BibT_eX]

[DOI]

Comput. Complex., 2006

Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

06111 Abstracts Collection -- Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

06111 Executive Summary -- Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005

On the influence of the variable ordering for algorithmic learning using OBDDs.

[BibT_eX]

[DOI]

Petr Savický

Ingo Wegener

Inf. Comput., 2005

Design Principles for Combiners with Memory.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2005

2004

On relations between counting communication complexity classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

2003

Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography.

[BibT_eX]

[DOI]

Hans Ulrich Simon

Comb. Probab. Comput., 2003

Algebraic Attacks on Combiners with Memory.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2001

BDD-based Cryptanalysis of Keystream Generators

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.

[BibT_eX]

[DOI]

Comput. Complex., 2001

On the Minimal Hardware Complexity of Pseudorandom Function Generators.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

[BibT_eX]

[DOI]

Jürgen Forster

Satyanarayana V. Lokam

Rustam Mubarakzjanov

Niels Schmitt

Hans Ulrich Simon

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Improved Cryptanalysis of the Self-Shrinking Generator.

[BibT_eX]

[DOI]

Erik Zenner

Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000

Contrast-optimal k out of n secret sharing schemes in visual cryptography.

[BibT_eX]

[DOI]

Thomas Hofmeister

Hans Ulrich Simon

Theor. Comput. Sci., 2000

On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

1999

Approximations by OBDDs and the variable ordering problem

[BibT_eX]

[DOI]

Petr Savický

Ingo Wegener

Electron. Colloquium Comput. Complex., 1999

1998

Computing Boolean Functions by Polynomials and Threshold Circuits.

[BibT_eX]

[DOI]

Pavel Pudlák

Comput. Complex., 1998

1997

On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates.

[BibT_eX]

[DOI]

Pavel Pudlák

Theor. Comput. Sci., 1997

1996

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.

[BibT_eX]

Math. Syst. Theory, 1995

A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

On Realizing Iterated Multiplication by Small Depth Threshold Circuits.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

On Computing Boolean Functions by Sparse Real Polynomials.

[BibT_eX]

[DOI]

Pavel Pudlák

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Separating Oblivious Linear Length MODp-Branching Program Classes.

[BibT_eX]

J. Inf. Process. Cybern., 1994

Constrained Combinatorial Optimization with an Evolution Strategy.

[BibT_eX]

[DOI]

Volker Nissen

Proceedings of the Fuzzy Logik, 1994

1992

Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits

[BibT_eX]

[DOI]

Inf. Comput., February, 1992

Separating Counting Communication Complexity Classes

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1992

Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1992

1991

On Oblivious Branching Programs of Linear Length

[BibT_eX]

[DOI]

Inf. Comput., October, 1991

Lower Bounds for Depth-Restricted Branching Programs

[BibT_eX]

[DOI]

Inf. Comput., March, 1991

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Untere Schranken für Berechnungen durch Verzweigungsprogramme.

[BibT_eX]

[DOI]

PhD thesis, 1989

Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

On Oblivious Branching Programs of Linear Length (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs.

[BibT_eX]

J. Inf. Process. Cybern., 1988

Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe.

[BibT_eX]

[DOI]