René Peralta

From MaRDI portal
Person:276553

Available identifiers

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

List of research outcomes





PublicationDate of PublicationType
Boolean functions with multiplicative complexity 3 and 42021-07-13Paper
Upper bounds on the multiplicative complexity of symmetric Boolean functions2020-05-12Paper
Better Circuits for Binary Polynomial Multiplication2019-08-13Paper
The multiplicative complexity of 6-variable Boolean functions2019-01-08Paper
Small low-depth circuits for cryptographic applications2019-01-08Paper
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)2018-06-15Paper
Near-optimal algorithm to count occurrences of subsequences of a given length2017-10-20Paper
On various nonlinearity measures for Boolean functions2016-05-04Paper
Spreading alerts quietly and the subgroup escape problem2016-01-11Paper
The Multiplicative Complexity of Boolean Functions on Four and Five Variables2015-09-18Paper
Computation in networks of passively mobile finite-state sensors2015-08-03Paper
Short Discreet Proofs2014-08-20Paper
Secure sealed-bid online auctions using discreet cryptographic proofs2014-05-14Paper
Logic minimization techniques with applications to cryptology2013-06-27Paper
Four measures of nonlinearity2013-06-07Paper
On the Shortest Linear Straight-Line Program for Computing Linear Forms2009-02-03Paper
Tight bounds for the multiplicative complexity of symmetric functions2008-05-28Paper
Spreading Alerts Quietly and the Subgroup Escape Problem2008-03-18Paper
Concrete Multiplicative Complexity of Symmetric Functions2007-09-05Paper
https://portal.mardi4nfdi.de/entity/Q27086162001-07-17Paper
Short non-interactive cryptographic proofs2000-12-21Paper
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42510101999-06-17Paper
Subquadratic zero-knowledge1998-01-28Paper
Asymptotic semismoothness probabilities1996-12-03Paper
https://portal.mardi4nfdi.de/entity/Q43187061995-07-19Paper
Primality testing with fewer random bits1994-05-08Paper
On the communication complexity of zero-knowledge proofs1993-08-29Paper
https://portal.mardi4nfdi.de/entity/Q40368551993-05-18Paper
Addendum to “simple constructions of almost k-wise independent random variables”1993-05-16Paper
Simple Constructions of Almost k-wise Independent Random Variables1992-10-18Paper
On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q32101821990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37910771988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37809911987-01-01Paper
Simultaneous Security of Bits in the Discrete Log1986-01-01Paper
A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37343021986-01-01Paper

Research outcomes over time

This page was built for person: René Peralta