On computing the immunity of Boolean power functions against fast algebraic attacks

DOI10.1007/978-3-319-53177-9_16MaRDI QIDQ2988353zbMATH OpenOpenAlexFDO

Authors Yusong Du, Baodian Wei

Publication date 19 May 2017

Published in Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-53177-9_16

zbMATH Keywords

algebraic immunityBoolean power functionfast algebraic attackstream cipher

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Recommendations

• Fast algebraic immunity of Boolean functions
• On the resistance of Boolean functions against fast algebraic attacks
• Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• A note on the optimal immunity of Boolean functions against fast algebraic attacks

Cites work

• Advances in Cryptology - CRYPTO 2003
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
• Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
• Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
• Fast Software Encryption
• On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
• On the resistance of Boolean functions against fast algebraic attacks
• Perfect algebraic immune functions
• Upper Bounds on Algebraic Immunity of Boolean Power Functions

Cited in

(10)

• On the fast algebraic immunity of majority functions
• Fast algebraic immunity of Boolean functions
• On algebraic immunity of trace inverse functions on finite fields of characteristic two
• On the lower block triangular nature of the incidence matrices to compute the algebraic immunity of Boolean functions
• On the resistance of Boolean functions against fast algebraic attacks
• Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• A note on the optimal immunity of Boolean functions against fast algebraic attacks
• More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
• Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks

This page was built for publication: On computing the immunity of Boolean power functions against fast algebraic attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988353)