René Peralta

Available identifiers

zbMath Open peralta.rene-cDBLP98/2222WikidataQ57190287 ScholiaQ57190287MaRDI QIDQ276553

List of research outcomes

Publication	Date of Publication	Type
Boolean functions with multiplicative complexity 3 and 4	2021-07-13	Paper
Upper bounds on the multiplicative complexity of symmetric Boolean functions	2020-05-12	Paper
Better Circuits for Binary Polynomial Multiplication	2019-08-13	Paper
The multiplicative complexity of 6-variable Boolean functions	2019-01-08	Paper
Small low-depth circuits for cryptographic applications	2019-01-08	Paper
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)	2018-06-15	Paper
Near-optimal algorithm to count occurrences of subsequences of a given length	2017-10-20	Paper
On various nonlinearity measures for Boolean functions	2016-05-04	Paper
Spreading alerts quietly and the subgroup escape problem	2016-01-11	Paper
The Multiplicative Complexity of Boolean Functions on Four and Five Variables	2015-09-18	Paper
Computation in networks of passively mobile finite-state sensors	2015-08-03	Paper
Short Discreet Proofs	2014-08-20	Paper
Secure sealed-bid online auctions using discreet cryptographic proofs	2014-05-14	Paper
Logic minimization techniques with applications to cryptology	2013-06-27	Paper
Four measures of nonlinearity	2013-06-07	Paper
On the Shortest Linear Straight-Line Program for Computing Linear Forms	2009-02-03	Paper
Tight bounds for the multiplicative complexity of symmetric functions	2008-05-28	Paper
Spreading Alerts Quietly and the Subgroup Escape Problem	2008-03-18	Paper
Concrete Multiplicative Complexity of Symmetric Functions	2007-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q2708616	2001-07-17	Paper
Short non-interactive cryptographic proofs	2000-12-21	Paper
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).	2000-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q4251010	1999-06-17	Paper
Subquadratic zero-knowledge	1998-01-28	Paper
Asymptotic semismoothness probabilities	1996-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q4318706	1995-07-19	Paper
Primality testing with fewer random bits	1994-05-08	Paper
On the communication complexity of zero-knowledge proofs	1993-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q4036855	1993-05-18	Paper
Addendum to “simple constructions of almost k-wise independent random variables”	1993-05-16	Paper
Simple Constructions of Almost k-wise Independent Random Variables	1992-10-18	Paper
On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3210182	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3791077	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3780991	1987-01-01	Paper
Simultaneous Security of Bits in the Discrete Log	1986-01-01	Paper
A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3734302	1986-01-01	Paper

Research outcomes over time

This page was built for person: René Peralta