Sosa-Gómez, GuillermoGuillermoSosa-GómezOctavio Paez-OsunaRojas, OmarOmarRojasEvaristo José Madarro-Capó2023-04-022023-04-022021https://scripta.up.edu.mx/handle/20.500.12552/336210.3390/axioms10020042<jats:p>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.</jats:p>Resource Types::text::journal::journal article