Results on the immunity of Boolean functions against probabilistic algebraic attacks

Authors:
Meicheng Liu;Dongdai Lin;Dingyi Pei
Affiliations:
The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;College of Mathematics and Information Sciences, Guangzhou University, Guangzhou, China
Venue:
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Year:
2011

Citing 11
Cited 0

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

Designs, Codes and Cryptography
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
Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison

IEEE Transactions on Information Theory
Algebraic attacks on stream ciphers with linear feedback

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Results on algebraic immunity for cryptographically significant boolean functions

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
On the higher order nonlinearities of algebraic immune functions

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
On algebraic immunity and annihilators

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Probabilistic algebraic attacks

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
On the Construction of Boolean Functions With Optimal Algebraic Immunity

IEEE Transactions on Information Theory
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the immunity of Boolean functions against probabilistic algebraic attacks. We first show that there are functions, using as filters in a linear feedback shift register based nonlinear filter generator, such that probabilistic algebraic attacks outperform deterministic ones. Then we introduce two notions, algebraic immunity distance and k-error algebraic immunity, to measure the ability of Boolean functions resistant to probabilistic algebraic attacks. We analyze both lower and upper bounds on algebraic immunity distance, and also present the relations among algebraic immunity distance, k-error algebraic immunity, algebraic immunity and high order nonlinearity.