Cryptology ePrint Archive: Report 2019/217

A family of boolean functions with good cryptographic properties

Guillermo Sosa Gómez and Octavio Paez Osuna

Abstract: 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, 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.

Category / Keywords: foundations / Boolean functions, linear codes, Reed-Solomon codes

Date: received 24 Feb 2019

Contact author: octavio paezosuna at ronininstitute org

Available format(s): PDF | BibTeX Citation

Version: 20190227:030441 (All versions of this report)

Short URL: ia.cr/2019/217


[ Cryptology ePrint archive ]