Perfect algebraic immune functions

Authors:
Meicheng Liu;Yin Zhang;Dongdai Lin
Affiliations:
SKLOIS, Institute of Information Engineering, CAS, Beijing, P.R. China;SKLOIS, Institute of Information Engineering, CAS, Beijing, P.R. China;SKLOIS, Institute of Information Engineering, CAS, Beijing, P.R. China
Venue:
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Year:
2012

Citing 18
Cited 1

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

Designs, Codes and Cryptography
Sequences, DFT and Resistance against Fast Algebraic Attacks

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Maximal values of generalized algebraic immunity

Designs, Codes and Cryptography
Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis

Information Security and Cryptology --- ICISC 2008
Algebraic attacks on stream ciphers with linear feedback

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
On the security of the Feng---Liao---Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks

Designs, Codes and Cryptography
On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation

IEEE Transactions on Information Theory
A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity

Designs, Codes and Cryptography
Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Results on algebraic immunity for cryptographically significant boolean functions

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Efficient computation of algebraic immunity for algebraic and fast algebraic attacks

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Cryptanalysis of sfinks

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
On the Construction of Boolean Functions With Optimal Algebraic Immunity

IEEE Transactions on Information Theory
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions

IEEE Transactions on Information Theory
More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks

IEEE Transactions on Information Theory
On the resistance of boolean functions against fast algebraic attacks

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Algebraic immunity of S-boxes and augmented functions

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption

On the immunity of rotation symmetric Boolean functions against fast algebraic attacks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A perfect algebraic immune function is a Boolean function with perfect immunity against algebraic and fast algebraic attacks. The main results are that for a perfect algebraic immune balanced function the number of input variables is one more than a power of two; for a perfect algebraic immune unbalanced function the number of input variables is a power of two. Also, for n equal to a power of two, the Carlet-Feng functions on n+1 variables and the modified Carlet-Feng functions on n variables are shown to be perfect algebraic immune functions.