Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation

DOI10.1080/00207160.2014.999051zbMath1376.94047MaRDI QIDQ2804904

Sitao Wang, Zhao Wang, Xiao Zhang, Wen-Hua Wang, Zhi Ming Zheng

Publication date: 6 May 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.999051

zbMATH Keywords

nonlinearity; Boolean functions; algebraic immunity; resiliency; fast algebraic attacks

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography

Related Items

A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function, Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields

Cites Work

• Optimized statistical analysis of software trustworthiness attributes
• Boolean functions optimizing most of the cryptographic criteria
• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Maiorana–McFarland Class: Degree Optimization and Algebraic Properties
• On the Construction of Boolean Functions With Optimal Algebraic Immunity
• Further constructions of resilient Boolean functions with very high nonlinearity
• Concurrent All-Cell Error Detection in Semi-Systolic Multiplier Using Linear Codes
• More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
• Shift-register synthesis and BCH decoding