Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Boolean functionslinear codesReed-Solomon codes
- Contact author(s)
- octavio paezosuna @ ronininstitute org
- History
- 2019-02-27: received
- Short URL
- https://ia.cr/2019/217
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/217,
author = {Guillermo Sosa Gómez and Octavio Paez Osuna},
title = {A family of boolean functions with good cryptographic properties},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/217},
year = {2019},
url = {https://eprint.iacr.org/2019/217}
}
