Linear codes from vectorial Boolean functions in the context of algebraic attacks
From MaRDI portal
Publication:5013480
DOI10.1142/S1793830921500324zbMath1495.94102OpenAlexW3091788636MaRDI QIDQ5013480
Kenza Guenda, Sihem Mesnager, M. Boumezbeur
Publication date: 30 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500324
weight distributionannihilatorscyclic codesalgebraic attacksalgebraic immunityvectorial functionsLCD codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Cyclic codes (94B15) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the minimum weight of linear codes
- On the construction of multi-output Boolean functions with optimal algebraic immunity
- On the nonlinearity of S-boxes and linear codes
- Maximal values of generalized algebraic immunity
- Linear codes with complementary duals
- On extended algebraic immunity
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Codes from Difference Sets
- Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
- Searching for linear codes with large minimum distance
- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Communication Theory of Secrecy Systems*
- The intractability of computing the minimum distance of a code
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Annihilators of Fast Discrete Fourier Spectra Attacks
- Advances in Cryptology - EUROCRYPT 2004
- On Algebraic Immunity and Annihilators
- Reversible codes
This page was built for publication: Linear codes from vectorial Boolean functions in the context of algebraic attacks
