NDLI: On the security of the Feng–Liao–Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks

Content Provider	Springer Nature Link
Author	Rizomiliotis, Panagiotis
Copyright Year	2010
Abstract	In the past few years, algebraic attacks against stream ciphers with linear feedback function have been significantly improved. As a response to the new attacks, the notion of algebraic immunity of a Boolean function f was introduced, defined as the minimum degree of the annihilators of f and f + 1. An annihilator of f is a nonzero Boolean function g, such that fg = 0. There is an increasing interest in construction of Boolean functions that possess optimal algebraic immunity, combined with other characteristics, like balancedness, high nonlinearity, and high algebraic degree. In this paper, we investigate a recently proposed infinite class of balanced Boolean functions with optimal algebraic immunity, optimum algebraic degree and much better nonlinearity than all the previously introduced classes of Boolean functions with maximal algebraic immunity. More precisely, we study the resistance of the functions against one of the new algebraic attacks, namely the fast algebraic attacks (FAAs). Using the special characteristics of the family members, we introduce an efficient method for the evaluation of their behavior against these attacks. The new algorithm is based on the well studied Berlekamp–Massey algorithm.
Ending Page	292
Page Count	10
Starting Page	283
File Format	PDF
ISSN	09251022
e-ISSN	15737586
Journal	Designs, Codes and Cryptography
Issue Number	3
Volume Number	57
Language	English
Publisher	Springer US
Publisher Date	2010-02-07
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information and Communication, Circuits Boolean functions Data Structures, Cryptology and Information Theory Algebraic immunity Discrete Mathematics in Computer Science Data Encryption Fast algebraic attack Boolean function Coding and Information Theory Cryptography Combinatorics Applications to coding theory and cryptography
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Discrete Mathematics and Combinatorics Theoretical Computer Science Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On extended algebraic immunity

Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks

On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

Enhanced Boolean functions suitable for the filter model of pseudo-random generator

Further properties of several classes of Boolean functions with optimum algebraic immunity

Improving algebraic attacks on stream ciphers based on linear feedback shift register over $$\mathbb {F}_{2^k}$$

Piecewise Constructions of Bent and Almost Optimal Boolean Functions

Maximal values of generalized algebraic immunity

On the security of the Feng–Liao–Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks

Similar Documents

On extended algebraic immunity

Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks

On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

Enhanced Boolean functions suitable for the filter model of pseudo-random generator

Further properties of several classes of Boolean functions with optimum algebraic immunity

Improving algebraic attacks on stream ciphers based on linear feedback shift register over $$\mathbb {F}_{2^k}$$

Piecewise Constructions of Bent and Almost Optimal Boolean Functions

Maximal values of generalized algebraic immunity

On the security of the Feng–Liao–Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks