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_8zbMATH Open1401.94145OpenAlexW2294940864MaRDI QIDQ2947149FDOQ2947149

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

Recommendations

• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• A note on the optimal immunity of Boolean functions against fast algebraic attacks
• Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
• On Algebraic Immunity and Annihilators
• On computing the immunity of Boolean power functions against fast algebraic attacks

zbMATH Keywords

power functionBoolean functioncryptographyalgebraic immunity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
• Reducing the Number of Homogeneous Linear Equations in Finding Annihilators

Cited In (3)

• A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks
• Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
• On algebraic immunity of trace inverse functions on finite fields of characteristic two

This page was built for publication: On the lower block triangular nature of the incidence matrices to compute the algebraic immunity of Boolean functions

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