On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions

DOI10.1007/978-3-319-23021-4_8zbMath1401.94145OpenAlexW2294940864MaRDI QIDQ2947149

Deepak Kumar Dalai

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_8

zbMATH Keywords

cryptographyBoolean functionpower functionalgebraic immunity

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items (2)

On algebraic immunity of trace inverse functions on finite fields of characteristic two ⋮ A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks

Cites Work

• Unnamed Item
• Reducing the Number of Homogeneous Linear Equations in Finding Annihilators
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• Advances in Cryptology - EUROCRYPT 2004
• Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions