Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
From MaRDI portal
Publication:5458279
DOI10.1007/11941378_17zbMath1175.94074OpenAlexW1538870113MaRDI QIDQ5458279
Publication date: 11 April 2008
Published in: Progress in Cryptology - INDOCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11941378_17
Related Items
A characterization of balanced Boolean functions with optimal algebraic immunity ⋮ On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions ⋮ On Cryptographically Significant Mappings over GF(2 n ) ⋮ Mutually Clock-Controlled Feedback Shift Registers Provide Resistance to Algebraic Attacks ⋮ An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity ⋮ Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\) ⋮ A note on two classes of Boolean functions with optimal algebraic immunity
Uses Software