My research interests include Algebraic Curves over Finite Fields and its applications to Cryptography, Error Correcting Codes and Combinatorial Configurations. I research methods to perform operations more efficiently for Elliptic and Hyperelliptic curve based cryptographic protocols which require shorter keys than RSA, reducing computational costs and, at the same time providing equivalent secrecy levels.
Boolean Functions are functions that combine the output of several cryptographic algorithms to generate strong encryption keys. By applying the theory of error correcting codes I am currently working on the construction of new Boolean Functions with good cryptographic properties.
I learned to use computers, graphic processing units (GPU) and supercomputers to classify combinatorial configurations. Combinatorial configurations have applications in the design of experiments, group testing and deep space communications.
After more than 13 years as a professor I moved to industry as a software developer on Big-Data developing GPU accelerated parallel algorithms and, more recently accelerating algorithms for virtual reality,augmented reality, and robotics applications.
Contact Octavio at firstname.lastname@example.org