Octavio Paez-Osuna

Dr. Octavio Paez-Osuna

Ronin Institute, Montclair, California, USA
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2006 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
OPOctavio Paez-Osuna
Octavio Paez-Osuna

25 March 2021 in Axioms
Verified
Journal Article
Open access
PDF file
Guillermo Sosa-GómezGuillermo Sosa-Gómez
Guillermo Sosa-Gómez
OPOctavio Paez-Osuna
Octavio Paez-Osuna
Omar RojasOmar Rojas
Omar Rojas
ECEvaristo José Madarro Capó
Evaristo José Madarro Capó
In 2005, Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of the Maiorana–McFarland’s (MM) construction of bent functions. In this paper, we study a new family of Boolean functions with cryptographically strong properties, such as non-linearity, propagation criterion, resiliency, and balance. The construction of cryptographically strong Boolean functions is a daunting task, and there is currently a wide range of algebraic techniques and heuristics for constructing such functions; however, these methods can be complex, computationally difficult to implement, and not always produce a sufficient variety of functions. We present in this paper a construction of Boolean functions using algebraic codes following Guillot’s work.

22 March 2012 in Ars Mathematica Contemporanea
Verified
Journal Article
Closed access
OPOctavio Paez-Osuna
Octavio Paez-Osuna
RCRodolfo San Agustín Chi
Rodolfo San Agustín Chi
A parallel backtrack search is carried out to classify, up to isomorphism, all combinatorial (194) configurations. A total of 269 224 652 such configurations were found. We prove that two of the combinatorial (194) configurations are not geometrically realizable over any field. Also we confirmed the computation of the 971 171 combinatorial (184) configurations which lacked an independent verification.

11 March 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Guillermo Sosa-GómezGuillermo Sosa-Gómez
Guillermo Sosa-Gómez
OPOctavio Paez-Osuna
Octavio Paez-Osuna
Omar RojasOmar Rojas
Omar Rojas
PRPedro Luis del Ángel Rodríguez
Pedro Luis del Ángel Rodríguez
HKHerbert Kanarek
Herbert Kanarek
ECEvaristo José Madarro Capó
Evaristo José Madarro Capó
In 2005, Guillot published a method for the construction of Boolean functions using linear codes through the Maiorana–McFarland construction of Boolean functions. In this work, we present a construction using Hermitian codes, starting from the classic Maiorana–McFarland construction. This new construction describes how the set of variables is divided into two complementary subspaces, one of these subspaces being a Hermitian Code. The ideal theoretical parameters of the Hermitian code are proposed to reach desirable values of the cryptographic properties of the constructed Boolean functions such as nonlinearity, resiliency order, and order of propagation. An extension of Guillot’s work is also made regarding parameters selection using algebraic geometric tools, including explicit examples.

1 June 2015 in Studia Scientiarum Mathematicarum Hungarica
Verified
Journal Article
Closed access
EDEduardo Ruiz Duarte
Eduardo Ruiz Duarte
OPOctavio Paez-Osuna
Octavio Paez-Osuna
We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulæ for divisor doubling and addition of divisors with disjoint support in JF(C) using only base field operations. Explicit formulæ is presented for this third case and a different approach for divisor doubling.

17 February 2019 in HAL
Verified
Preprint
Open access
PDF file
GGGuillermo Sosa Gómez
Guillermo Sosa Gómez
OPOctavio Paez-Osuna
Octavio Paez-Osuna
OOOctavio Osuna
Octavio Osuna
In 2005, [2] Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of Maiorana-McFarland's construction of bent functions. In this paper, we study a new family of Boolean functions with cryptographically strong properties such as non-linearity, propagation criterion, resiliency and balance. The construction of cryptographically strong boolean functions is a daunting task and there is currently a wide range of algebraic techniques and heuristics for constructing such functions , however these methods can be complex, com-putationally difficult to implement and not always produce a sufficient variety of functions. We present in this paper a construction of Boolean functions using algebraic codes following Guillot's work.