The following pages link to René Peralta (Q276553):
Displayed 39 items.
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Primality testing with fewer random bits (Q1321031) (← links)
- Short non-interactive cryptographic proofs (Q1590362) (← links)
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (Q1641147) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Small low-depth circuits for cryptographic applications (Q1755189) (← links)
- (Q1978697) (redirect page) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Secure sealed-bid online auctions using discreet cryptographic proofs (Q2450498) (← links)
- (Q2708616) (← links)
- Short Discreet Proofs (Q2876893) (← links)
- The Multiplicative Complexity of Boolean Functions on Four and Five Variables (Q2946971) (← links)
- (Q3210182) (← links)
- On the Shortest Linear Straight-Line Program for Computing Linear Forms (Q3599124) (← links)
- Simultaneous Security of Bits in the Discrete Log (Q3718620) (← links)
- (Q3734302) (← links)
- (Q3780991) (← links)
- (Q3791077) (← links)
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810) (← links)
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number (Q3987946) (← links)
- Simple Constructions of Almost k-wise Independent Random Variables (Q4014640) (← links)
- Addendum to “simple constructions of almost k-wise independent random variables” (Q4034713) (← links)
- (Q4036855) (← links)
- (Q4251010) (← links)
- (Q4318706) (← links)
- Subquadratic zero-knowledge (Q4369895) (← links)
- Asymptotic semismoothness probabilities (Q4718417) (← links)
- Four Measures of Nonlinearity (Q4924638) (← links)
- Better Circuits for Binary Polynomial Multiplication (Q5228929) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)
- Spreading Alerts Quietly and the Subgroup Escape Problem (Q5451074) (← links)
- Computation in networks of passively mobile finite-state sensors (Q5501509) (← links)
- Concrete Multiplicative Complexity of Symmetric Functions (Q5756689) (← links)