| Publication | Date of Publication | Type |
|---|
Boolean functions with multiplicative complexity 3 and 4
Cryptography and Communications | 2021-07-13 | Paper |
Upper bounds on the multiplicative complexity of symmetric Boolean functions
Cryptography and Communications | 2020-05-12 | Paper |
Better Circuits for Binary Polynomial Multiplication
IEEE Transactions on Computers | 2019-08-13 | Paper |
The multiplicative complexity of 6-variable Boolean functions
Cryptography and Communications | 2019-01-08 | Paper |
Small low-depth circuits for cryptographic applications
Cryptography and Communications | 2019-01-08 | Paper |
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
Information Processing Letters | 2018-06-15 | Paper |
Near-optimal algorithm to count occurrences of subsequences of a given length
Discrete Mathematics, Algorithms and Applications | 2017-10-20 | Paper |
On various nonlinearity measures for Boolean functions
Cryptography and Communications | 2016-05-04 | Paper |
Spreading alerts quietly and the subgroup escape problem
Journal of Cryptology | 2016-01-11 | Paper |
The multiplicative complexity of Boolean functions on four and five variables
Lecture Notes in Computer Science | 2015-09-18 | Paper |
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Short discreet proofs
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Secure sealed-bid online auctions using discreet cryptographic proofs
Mathematical and Computer Modelling | 2014-05-14 | Paper |
Logic minimization techniques with applications to cryptology
Journal of Cryptology | 2013-06-27 | Paper |
Four measures of nonlinearity
Lecture Notes in Computer Science | 2013-06-07 | Paper |
On the Shortest Linear Straight-Line Program for Computing Linear Forms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science | 2008-05-28 | Paper |
Spreading Alerts Quietly and the Subgroup Escape Problem
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Concrete Multiplicative Complexity of Symmetric Functions
Lecture Notes in Computer Science | 2007-09-05 | Paper |
| scientific article; zbMATH DE number 1588471 (Why is no real title available?) | 2001-07-17 | Paper |
Short non-interactive cryptographic proofs
Journal of Cryptology | 2000-12-21 | Paper |
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
Theoretical Computer Science | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1304287 (Why is no real title available?) | 1999-06-17 | Paper |
Subquadratic zero-knowledge
Journal of the ACM | 1998-01-28 | Paper |
Asymptotic semismoothness probabilities
Mathematics of Computation | 1996-12-03 | Paper |
| scientific article; zbMATH DE number 708815 (Why is no real title available?) | 1995-07-19 | Paper |
Primality testing with fewer random bits
Computational Complexity | 1994-05-08 | Paper |
On the communication complexity of zero-knowledge proofs
Journal of Cryptology | 1993-08-29 | Paper |
| scientific article; zbMATH DE number 177019 (Why is no real title available?) | 1993-05-18 | Paper |
Addendum to “simple constructions of almost k-wise independent random variables”
Random Structures & Algorithms | 1993-05-16 | Paper |
Simple Constructions of Almost k-wise Independent Random Variables
Random Structures & Algorithms | 1992-10-18 | Paper |
| On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4191124 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4055525 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4041785 (Why is no real title available?) | 1987-01-01 | Paper |
Simultaneous Security of Bits in the Discrete Log
Advances in Cryptology — EUROCRYPT’ 85 | 1986-01-01 | Paper |
A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3965967 (Why is no real title available?) | 1986-01-01 | Paper |
