René Peralta - RankMe

67 papers A* 14A 1B 4C 3Misc 2Journal 35Unranked 7

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Traceable random numbers from a nonlocal quantum advantage. CoRR Gautam A. Kavuri, Jasper Palfree, Dileep V. Reddy, Yanbao Zhang, Joshua C. Bienfang, Michael D. Mazurek, Mohammad A. Alhejji, Aliza U. Siddiqui, Joseph M. Cavanagh, Aagam Dalal, Carlos Abellán, Waldimar Amaya, Morgan W. Mitchell, Katherine E. Stange, Paul D. Beale, Luís T. A. N. Brandão, Harold Booth, René Peralta, Sae Woo Nam, Richard P. Mirin, Martin J. Stevens, Emanuel Knill, Lynden K. Shalm
2023	J	`jnl`	Searching the space of tower field implementations of the 픽 Int. J. Inf. Comput. Secur. Zihao Wei, Siwei Sun, Lei Hu, Man Wei, René Peralta
2021	J	`jnl`	On the Multiplicative Complexity of Cubic Boolean Functions. IACR Cryptol. ePrint Arch. Meltem Sönmez Turan, René Peralta
2020	J	`jnl`	Boolean functions with multiplicative complexity 3 and 4. Cryptogr. Commun. Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2019	J	`jnl`	Better Circuits for Binary Polynomial Multiplication. IEEE Trans. Computers Magnus Gausdal Find, René Peralta
2019	J	`jnl`	Boolean Functions with Multiplicative Complexity 3 and 4. IACR Cryptol. ePrint Arch. Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2019	—	`conf`	Searching for Best Karatsuba Recurrences. SEA² Çagdas Çalik, Morris Dworkin, Nathan Dykas, René Peralta
2019	J	`jnl`	Small low-depth circuits for cryptographic applications. Cryptogr. Commun. Joan Boyar, Magnus Gausdal Find, René Peralta
2019	J	`jnl`	The multiplicative complexity of 6-variable Boolean functions. Cryptogr. Commun. Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2019	J	`jnl`	Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptol. ePrint Arch. Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2019	J	`jnl`	Upper bounds on the multiplicative complexity of symmetric Boolean functions. Cryptogr. Commun. Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2018	J	`jnl`	Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Inf. Process. Lett. Andrea Visconti, Chiara Valentina Schiavo, René Peralta
2018	J	`jnl`	The Multiplicative Complexity of 6-variable Boolean Functions. IACR Cryptol. ePrint Arch. Çagdas Çalik, Meltem Sönmez Turan, René Peralta
2017	J	`jnl`	Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). IACR Cryptol. ePrint Arch. Andrea Visconti, Chiara Valentina Schiavo, René Peralta
2017	J	`jnl`	Near-optimal algorithm to count occurrences of subsequences of a given length. Discret. Math. Algorithms Appl. Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, René Peralta
2016	J	`jnl`	On various nonlinearity measures for boolean functions. Cryptogr. Commun. Joan Boyar, Magnus Gausdal Find, René Peralta
2015	J	`jnl`	Spreading Alerts Quietly and the Subgroup Escape Problem. J. Cryptol. James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta
2015	J	`jnl`	The Multiplicative Complexity of Boolean Functions on Four and Five Variables. IACR Cryptol. ePrint Arch. Meltem Sönmez Turan, René Peralta
2014	—	`conf`	The Multiplicative Complexity of Boolean Functions on Four and Five Variables. LightSec Meltem Sönmez Turan, René Peralta
2013	C	`conf`	Four Measures of Nonlinearity. CIAC Joan Boyar, Magnus Find, René Peralta
2013	J	`jnl`	Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. Joan Boyar, Magnus Find, René Peralta
2013	J	`jnl`	Logic Minimization Techniques with Applications to Cryptology. J. Cryptol. Joan Boyar, Philip Matthews, René Peralta
2013	J	`jnl`	Secure sealed-bid online auctions using discreet cryptographic proofs. Math. Comput. Model. José A. Montenegro, Michael J. Fischer, Javier López, René Peralta
2012	Misc	`conf`	A Small Depth-16 Circuit for the AES S-Box. SEC Joan Boyar, René Peralta
2011	C	`conf`	A Public Randomness Service. SECRYPT Michael J. Fischer, Michaela Iorga, René Peralta
2011	J	`jnl`	A depth-16 circuit for the AES S-box. IACR Cryptol. ePrint Arch. Joan Boyar, René Peralta
2010	B	`conf`	A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA Joan Boyar, René Peralta
2009	J	`jnl`	New logic minimization techniques with applications to cryptology. IACR Cryptol. ePrint Arch. Joan Boyar, René Peralta
2008	B	`conf`	On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS Joan Boyar, Philip Matthews, René Peralta
2008	J	`jnl`	Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. Joan Boyar, René Peralta
2007	C	`ed.`	Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings ISC Juan A. Garay, Arjen K. Lenstra, Masahiro Mambo, René Peralta
2006	J	`jnl`	Computation in networks of passively mobile finite-state sensors. Distributed Comput. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2006	B	`conf`	Concrete Multiplicative Complexity of Symmetric Functions. MFCS Joan Boyar, René Peralta
2005	—	`conf`	Cryptographic Primitives Can Be Fragile. VISSAS René Peralta
2005	—	`conf`	Dark Encounter Computations. MADNES René Peralta
2005	A	`conf`	Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
2005	J	`jnl`	Spreading Alerts Quietly and the Subgroup Escape Problem. IACR Cryptol. ePrint Arch. James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
2005	B	`conf`	Stably Computable Properties of Network Graphs. DCOSS Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
2005	J	`jnl`	The Exact Multiplicative Complexity of the Hamming Weight Function Electron. Colloquium Comput. Complex. Joan Boyar, René Peralta
2004	A*	`conf`	Computation in networks of passively mobile finite-state sensors. PODC Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2003	J	`jnl`	Analysis of e-commerce protocols: Adapting a traditional technique. Int. J. Inf. Sec. Sigrid Gürgens, Javier López, René Peralta
2003	—	`ch.`	Issues, Non-Issues, and Cryptographic Tools for Internet-Based Voting. Secure Electronic Voting René Peralta
2000	J	`jnl`	On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theor. Comput. Sci. Joan Boyar, René Peralta, Denis Pochuev
2000	J	`jnl`	Short Non-Interactive Cryptographic Proofs. J. Cryptol. Joan Boyar, Ivan Damgård, René Peralta
2000	Misc	`conf`	Validation of Cryptographic Protocols by Efficient Automated Testing. FLAIRS Sigrid Gürgens, René Peralta
1999	—	`conf`	Efficient Detection of Failure Modes in Electronic Commerce Protocols. DEXA Workshop Sigrid Gürgens, Javier López, René Peralta
1999	—	`conf`	Implementation of Virtual Private Networks at the Transport Layer. ISW Jorge Dávila, Javier López, René Peralta
1997	—	`conf`	High-Speed Cryptography. ISW George I. Davida, René Peralta
1996	J	`jnl`	Asymptotic semismoothness probabilities. Math. Comput. Eric Bach, René Peralta
1996	A*	`conf`	Short Discrete Proofs. EUROCRYPT Joan Boyar, René Peralta
1995	J	`jnl`	Subquadratic Zero-Knowledge. J. ACM Joan Boyar, Gilles Brassard, René Peralta
1993	J	`jnl`	Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Random Struct. Algorithms Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1993	J	`jnl`	On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptol. Joan Boyar, Carsten Lund, René Peralta
1993	J	`jnl`	Primality Testing with Fewer Random Bits. Comput. Complex. René Peralta, Victor Shoup
1992	A*	`conf`	A Quadratic Sieve on the n-Dimensional Cube. CRYPTO René Peralta
1992	J	`jnl`	Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algorithms Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1991	A*	`conf`	Subquadratic Zero-Knowledge FOCS Joan Boyar, Gilles Brassard, René Peralta
1990	A*	`conf`	On the Importance of Memory Resources in the Security of Key Exchange Protocols. EUROCRYPT George I. Davida, Yvo Desmedt, René Peralta
1990	A*	`conf`	Simple Constructions of Almost k-Wise Independent Random Variables FOCS Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1989	A*	`conf`	A Key Distribution System Based On Any One-Way Function (Extended Abstract). EUROCRYPT George I. Davida, Yvo Desmedt, René Peralta
1989	A*	`conf`	On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO Joan Boyar, René Peralta
1987	A*	`conf`	A Simple and Secure Way to Show the Validity of Your Public Key. CRYPTO Jeroen van de Graaf, René Peralta
1986	A*	`conf`	A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number. EUROCRYPT René Peralta, Jeroen van de Graaf
1986	A*	`conf`	Demonstrating Possession of a Discrete Logarithm Without Revealing It. CRYPTO David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta
1985	A*	`conf`	A Framework for the Study of Cryptographic Protocols. CRYPTO Richard Berger, Sampath Kannan, René Peralta
1985	A*	`conf`	Simultaneous Security of Bits in the Discrete Log. EUROCRYPT René Peralta
1984	A*	`conf`	A Provably Secure Oblivious Transfer Protocol. EUROCRYPT Richard Berger, René Peralta, Tom Tedrick