René Peralta

Publication Activity (10 Years)

Years Active: 1984-2021
Publications (10 Years): 15

Top Topics

Boolean Functions

Membership Queries

Prime Implicants

Top Venues

IACR Cryptol. ePrint Arch.

Cryptogr. Commun.

Inf. Process. Lett.

Publications

Meltem Sönmez Turan, René Peralta
On the Multiplicative Complexity of Cubic Boolean Functions. IACR Cryptol. ePrint Arch. 2021 (2021)
Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Boolean functions with multiplicative complexity 3 and 4. Cryptogr. Commun. 12 (5) (2020)
Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Upper bounds on the multiplicative complexity of symmetric Boolean functions. Cryptogr. Commun. 11 (6) (2019)
Magnus Gausdal Find, René Peralta
Better Circuits for Binary Polynomial Multiplication. IEEE Trans. Computers 68 (4) (2019)
Joan Boyar, Magnus Gausdal Find, René Peralta
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11 (1) (2019)
Çagdas Çalik, Meltem Sönmez Turan, René Peralta
The multiplicative complexity of 6-variable Boolean functions. Cryptogr. Commun. 11 (1) (2019)
Zihao Wei, Siwei Sun, Lei Hu, Man Wei, Joan Boyar, René Peralta
Inverter - with Applications to AES, Camellia, and SM4. IACR Cryptol. ePrint Arch. 2019 (2019)
Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Çagdas Çalik, Morris Dworkin, Nathan Dykas, René Peralta
Searching for Best Karatsuba Recurrences. SEA² (2019)
Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Boolean Functions with Multiplicative Complexity 3 and 4. IACR Cryptol. ePrint Arch. 2019 (2019)
Andrea Visconti, Chiara Valentina Schiavo, René Peralta
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Inf. Process. Lett. 137 (2018)
Çagdas Çalik, Meltem Sönmez Turan, René Peralta
The Multiplicative Complexity of 6-variable Boolean Functions. IACR Cryptol. ePrint Arch. 2018 (2018)
Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, René Peralta
Near-optimal algorithm to count occurrences of subsequences of a given length. Discret. Math. Algorithms Appl. 9 (3) (2017)
Andrea Visconti, Chiara Valentina Schiavo, René Peralta
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). IACR Cryptol. ePrint Arch. 2017 (2017)
Joan Boyar, Magnus Gausdal Find, René Peralta
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8 (3) (2016)
Meltem Sönmez Turan, René Peralta
The Multiplicative Complexity of Boolean Functions on Four and Five Variables. IACR Cryptol. ePrint Arch. 2015 (2015)
James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta
Spreading Alerts Quietly and the Subgroup Escape Problem. J. Cryptol. 28 (4) (2015)
Meltem Sönmez Turan, René Peralta
The Multiplicative Complexity of Boolean Functions on Four and Five Variables. LightSec (2014)
José A. Montenegro, Michael J. Fischer, Javier López, René Peralta
Secure sealed-bid online auctions using discreet cryptographic proofs. Math. Comput. Model. 57 (11-12) (2013)
Joan Boyar, Philip Matthews, René Peralta
Logic Minimization Techniques with Applications to Cryptology. J. Cryptol. 26 (2) (2013)
Joan Boyar, Magnus Find, René Peralta
Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. 2013 (2013)
Joan Boyar, Magnus Find, René Peralta
Four Measures of Nonlinearity. CIAC (2013)
Joan Boyar, René Peralta
A Small Depth-16 Circuit for the AES S-Box. SEC (2012)
Joan Boyar, René Peralta
A depth-16 circuit for the AES S-box. IACR Cryptol. ePrint Arch. 2011 (2011)
Michael J. Fischer, Michaela Iorga, René Peralta
A Public Randomness Service. SECRYPT (2011)
Joan Boyar, René Peralta
A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA (2010)
Joan Boyar, René Peralta
New logic minimization techniques with applications to cryptology. IACR Cryptol. ePrint Arch. 2009 (2009)
Joan Boyar, René Peralta
Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396 (1-3) (2008)
Joan Boyar, Philip Matthews, René Peralta
On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS (2008)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18 (4) (2006)
Joan Boyar, René Peralta
Concrete Multiplicative Complexity of Symmetric Functions. MFCS (2006)
James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT (2005)
James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
Spreading Alerts Quietly and the Subgroup Escape Problem. IACR Cryptol. ePrint Arch. 2005 (2005)
René Peralta
Dark Encounter Computations. MADNES (2005)
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
Stably Computable Properties of Network Graphs. DCOSS (2005)
Joan Boyar, René Peralta
The Exact Multiplicative Complexity of the Hamming Weight Function Electron. Colloquium Comput. Complex. (049) (2005)
René Peralta
Cryptographic Primitives Can Be Fragile. VISSAS (2005)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. PODC (2004)
Sigrid Gürgens, Javier López, René Peralta
Analysis of e-commerce protocols: Adapting a traditional technique. Int. J. Inf. Sec. 2 (1) (2003)
Joan Boyar, René Peralta, Denis Pochuev
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theor. Comput. Sci. 235 (1) (2000)
Sigrid Gürgens, René Peralta
Validation of Cryptographic Protocols by Efficient Automated Testing. FLAIRS Conference (2000)
Joan Boyar, Ivan Damgård, René Peralta
Short Non-Interactive Cryptographic Proofs. J. Cryptol. 13 (4) (2000)
Jorge Dávila, Javier López, René Peralta
Implementation of Virtual Private Networks at the Transport Layer. ISW (1999)
Sigrid Gürgens, Javier López, René Peralta
Efficient Detection of Failure Modes in Electronic Commerce Protocols. DEXA Workshop (1999)
George I. Davida, René Peralta
High-Speed Cryptography. ISW (1997)
Joan Boyar, René Peralta
Short Discrete Proofs. EUROCRYPT (1996)
Eric Bach, René Peralta
Asymptotic semismoothness probabilities. Math. Comput. 65 (216) (1996)
Joan Boyar, Gilles Brassard, René Peralta
Subquadratic Zero-Knowledge. J. ACM 42 (6) (1995)
Joan Boyar, Carsten Lund, René Peralta
On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptol. 6 (2) (1993)
René Peralta, Victor Shoup
Primality Testing with Fewer Random Bits. Comput. Complex. 3 (1993)
Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Random Struct. Algorithms 4 (1) (1993)
Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algorithms 3 (3) (1992)
René Peralta
A Quadratic Sieve on the n-Dimensional Cube. CRYPTO (1992)
Joan Boyar, Gilles Brassard, René Peralta
Subquadratic Zero-Knowledge FOCS (1991)
Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
Simple Constructions of Almost k-Wise Independent Random Variables FOCS (1990)
George I. Davida, Yvo Desmedt, René Peralta
On the Importance of Memory Resources in the Security of Key Exchange Protocols. EUROCRYPT (1990)
George I. Davida, Yvo Desmedt, René Peralta
A Key Distribution System Based On Any One-Way Function (Extended Abstract). EUROCRYPT (1989)
Joan Boyar, René Peralta
On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO (1989)
Jeroen van de Graaf, René Peralta
A Simple and Secure Way to Show the Validity of Your Public Key. CRYPTO (1987)
David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta
Demonstrating Possession of a Discrete Logarithm Without Revealing It. CRYPTO (1986)
René Peralta, Jeroen van de Graaf
A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number. EUROCRYPT (1986)
Richard Berger, Sampath Kannan, René Peralta
A Framework for the Study of Cryptographic Protocols. CRYPTO (1985)
René Peralta
Simultaneous Security of Bits in the Discrete Log. EUROCRYPT (1985)
Richard Berger, René Peralta, Tom Tedrick
A Provably Secure Oblivious Transfer Protocol. EUROCRYPT (1984)