René Peralta

IACR Cryptol. ePrint Arch., 2021

2020

Boolean functions with multiplicative complexity 3 and 4.

[BibT_eX]

[DOI]

Çagdas Çalik

Cryptogr. Commun., 2020

2019

Better Circuits for Binary Polynomial Multiplication.

[BibT_eX]

[DOI]

Magnus Gausdal Find

IEEE Trans. Computers, 2019

The multiplicative complexity of 6-variable Boolean functions.

[BibT_eX]

[DOI]

Çagdas Çalik

Cryptogr. Commun., 2019

Upper bounds on the multiplicative complexity of symmetric Boolean functions.

[BibT_eX]

[DOI]

Luís T. A. N. Brandão

Çagdas Çalik

Cryptogr. Commun., 2019

Small low-depth circuits for cryptographic applications.

[BibT_eX]

[DOI]

Magnus Gausdal Find

Cryptogr. Commun., 2019

Searching for Best Karatsuba Recurrences.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2).

[BibT_eX]

[DOI]

Andrea Visconti

Chiara Valentina Schiavo

Idelfonso Izquierdo-Marquez

Inf. Process. Lett., 2018

2017

Near-optimal algorithm to count occurrences of subsequences of a given length.

[BibT_eX]

[DOI]

Jose Torres-Jimenez

Daniel Ramirez-Acuna

Discret. Math. Algorithms Appl., 2017

2016

On various nonlinearity measures for boolean functions.

[BibT_eX]

[DOI]

Magnus Gausdal Find

Cryptogr. Commun., 2016

2015

Spreading Alerts Quietly and the Subgroup Escape Problem.

[BibT_eX]

[DOI]

J. Cryptol., 2015

The Multiplicative Complexity of Boolean Functions on Four and Five Variables.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2013

Secure sealed-bid online auctions using discreet cryptographic proofs.

[BibT_eX]

[DOI]

Math. Comput. Model., 2013

Logic Minimization Techniques with Applications to Cryptology.

[BibT_eX]

[DOI]

Philip Matthews

J. Cryptol., 2013

Four Measures of Nonlinearity.

[BibT_eX]

[DOI]

Magnus Find

IACR Cryptol. ePrint Arch., 2013

2012

A Small Depth-16 Circuit for the AES S-Box.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy Research, 2012

2011

A depth-16 circuit for the AES S-box.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

A Public Randomness Service.

[BibT_eX]

Michael J. Fischer

Michaela Iorga

Proceedings of the SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, Seville, Spain, 18, 2011

2010

A New Combinational Logic Minimization Technique with Applications to Cryptology.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

New logic minimization techniques with applications to cryptology.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

2008

Tight bounds for the multiplicative complexity of symmetric functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On the Shortest Linear Straight-Line Program for Computing Linear Forms.

[BibT_eX]

[DOI]

Philip Matthews

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2006

Computation in networks of passively mobile finite-state sensors.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Concrete Multiplicative Complexity of Symmetric Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

The Exact Multiplicative Complexity of the Hamming Weight Function

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Cryptographic Primitives Can Be Fragile.

[BibT_eX]

Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Dark Encounter Computations.

[BibT_eX]

[DOI]

Proceedings of the Secure Mobile Ad-hoc Networks and Sensors, First International Workshop, 2005

Stably Computable Properties of Network Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2005

2003

Issues, Non-Issues, and Cryptographic Tools for Internet-Based Voting.

[BibT_eX]

[DOI]

Proceedings of the Secure Electronic Voting, 2003

Analysis of e-commerce protocols: Adapting a traditional technique.

[BibT_eX]

[DOI]

Sigrid Gürgens

Javier López

Int. J. Inf. Sec., 2003

2000

On the multiplicative complexity of Boolean functions over the basis (cap, +, 1).

[BibT_eX]

[DOI]

Denis Pochuev

Theor. Comput. Sci., 2000

Short Non-Interactive Cryptographic Proofs.

[BibT_eX]

[DOI]

Ivan Damgård

J. Cryptol., 2000

Validation of Cryptographic Protocols by Efficient Automated Testing.

[BibT_eX]

[DOI]

Sigrid Gürgens

Proceedings of the Thirteenth International Florida Artificial Intelligence Research Society Conference, 2000

1999

Implementation of Virtual Private Networks at the Transport Layer.

[BibT_eX]

[DOI]

Jorge Dávila

Javier López

Proceedings of the Information Security, Second International Workshop, 1999

Efficient Detection of Failure Modes in Electronic Commerce Protocols.

[BibT_eX]

[DOI]

Sigrid Gürgens

Javier López

Proceedings of the 10th International Workshop on Database & Expert Systems Applications, 1999

1997

High-Speed Cryptography.

[BibT_eX]

[DOI]

George I. Davida

Proceedings of the Information Security, First International Workshop, 1997

1996

Asymptotic semismoothness probabilities.

[BibT_eX]

[DOI]

Eric Bach

Math. Comput., 1996

Short Discrete Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

1995

Subquadratic Zero-Knowledge.

[BibT_eX]

[DOI]

Gilles Brassard

J. ACM, 1995

1993

Addendum to "Simple Construction of Almost k-wise Independent Random Variables".

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

On the Communication Complexity of Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Carsten Lund

J. Cryptol., 1993

Primality Testing with Fewer Random Bits.

[BibT_eX]

[DOI]

Victor Shoup

Comput. Complex., 1993

1992

Simple Construction of Almost k-wise Independent Random Variables.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

A Quadratic Sieve on the n-Dimensional Cube.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1990

Simple Constructions of Almost k-Wise Independent Random Variables

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

On the Importance of Memory Resources in the Security of Key Exchange Protocols.

[BibT_eX]

[DOI]

George I. Davida

Yvo Desmedt

Proceedings of the Advances in Cryptology, 1990

1989

A Key Distribution System Based On Any One-Way Function (Extended Abstract).

[BibT_eX]

[DOI]

George I. Davida

Yvo Desmedt

Proceedings of the Advances in Cryptology, 1989

On the Concrete Complexity of Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1987

A Simple and Secure Way to Show the Validity of Your Public Key.

[BibT_eX]

[DOI]

Jeroen van de Graaf

Proceedings of the Advances in Cryptology, 1987

1986

A simple and fast probabilistic algorithm for computing square roots modulo a prime number.

[BibT_eX]

[DOI]

René C. Peralta

IEEE Trans. Inf. Theory, 1986

A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.

[BibT_eX]

Jeroen van de Graaf

EUROCRYPT, 1986

Demonstrating Possession of a Discrete Logarithm Without Revealing It.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1986

1985

Simultaneous Security of Bits in the Discrete Log.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

A Framework for the Study of Cryptographic Protocols.

[BibT_eX]

[DOI]

Richard Berger

Sampath Kannan

Proceedings of the Advances in Cryptology, 1985

1984

A Provably Secure Oblivious Transfer Protocol.

[BibT_eX]

[DOI]

Richard Berger