Constructing Two Classes of Boolean Functions With Good Cryptographic Properties

Wu et al. proposed a generalized Tu-Deng conjecture over <inline-formula> <tex-math notation="LaTeX">$\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ </tex-math></inline-formula>, and constructed Boolean functions with good properties. However the proof of the gen...

Full description

Bibliographic Details
Main Authors: Yindong Chen, Liu Zhang, Zhangquan Gong, Weihong Cai
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8868156/
Description
Summary:Wu et al. proposed a generalized Tu-Deng conjecture over <inline-formula> <tex-math notation="LaTeX">$\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ </tex-math></inline-formula>, and constructed Boolean functions with good properties. However the proof of the generalized conjecture is still open. Based on Wu&#x2019;s work and assuming that the conjecture is true, we come up with a new class of balanced Boolean functions which has optimal algebraic degree, high nonlinearity and optimal algebraic immunity. The Boolean function also behaves well against fast algebraic attacks. Meanwhile we construct another class of Boolean functions by concatenation, which is 1-resilient and also has other good cryptographic properties.
ISSN:2169-3536