Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

René Peralta

Showing results (1-10 of 9) with videos related to

Pageof 1
Sort By:
Journal of Research of the National Institute of Standards and Technology|July 17, 2024
Encounter Metrics and Exposure NotifcationRené Peralta, Angela Robinson
IEEE Transactions on Computers. Institute of Electrical and Electronics Engineers|October 4, 2019
Better Circuits for Binary Polynomial MultiplicationMagnus Gaudal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|April 19, 2019
Small Low-Depth Circuits for Cryptographic ApplicationsJoan Boyar, Magnus Gausdal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|January 14, 2021
The Multiplicative Complexity of 6-variable Boolean FunctionsÇağdaş Çalık, Meltem Sönmez Turan, René Peralta
Information Processing Letters|April 19, 2019
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)Andrea Visconti, Chiara Valentina Schiavo, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|July 27, 2016
On Various Nonlinearity Measures for Boolean FunctionsJoan Boyar, Magnus Gausdal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|March 3, 2021
Boolean Functions with Multiplicative Complexity 3 and 4Çağdaş Çalık, Meltem Sönmez Turan, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|March 3, 2020
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean FunctionsLuís T A N Brandão, Çağdaş Çalık, Meltem Sönmez Turan, et al.
Nature|June 11, 2025
Traceable random numbers from a non-local quantum advantageGautam A Kavuri, Jasper Palfree, Dileep V Reddy, et al.
Pageof 1

Showing results (1-10 of 9) with videos related to

Sort By:
Pageof 1
Journal of Research of the National Institute of Standards and Technology|July 17, 2024
Encounter Metrics and Exposure NotifcationRené Peralta, Angela Robinson
IEEE Transactions on Computers. Institute of Electrical and Electronics Engineers|October 4, 2019
Better Circuits for Binary Polynomial MultiplicationMagnus Gaudal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|April 19, 2019
Small Low-Depth Circuits for Cryptographic ApplicationsJoan Boyar, Magnus Gausdal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|January 14, 2021
The Multiplicative Complexity of 6-variable Boolean FunctionsÇağdaş Çalık, Meltem Sönmez Turan, René Peralta
Information Processing Letters|April 19, 2019
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)Andrea Visconti, Chiara Valentina Schiavo, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|July 27, 2016
On Various Nonlinearity Measures for Boolean FunctionsJoan Boyar, Magnus Gausdal Find, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|March 3, 2021
Boolean Functions with Multiplicative Complexity 3 and 4Çağdaş Çalık, Meltem Sönmez Turan, René Peralta
Cryptography and Communications : Discrete Structures, Boolean Functions and Sequences|March 3, 2020
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean FunctionsLuís T A N Brandão, Çağdaş Çalık, Meltem Sönmez Turan, et al.
Nature|June 11, 2025
Traceable random numbers from a non-local quantum advantageGautam A Kavuri, Jasper Palfree, Dileep V Reddy, et al.
Pageof 1