Boolean functions: degree and support
From MaRDI portal
Publication:1616170
DOI10.1007/s11786-018-0350-8zbMath1432.06008OpenAlexW2811104640MaRDI QIDQ1616170
Publication date: 1 November 2018
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-018-0350-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis and design of stream ciphers
- On the degree of Boolean functions as real polynomials
- Representing Boolean functions as polynomials modulo composite numbers
- Universal affine classification of Boolean functions
- Homogeneous bent functions, invariants, and designs
- Covering sequences of Boolean functions and their cryptographic significance
- Products of linear recurring sequences with maximum complexity
- Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
- New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
- Almost Security of Cryptographic Boolean Functions
- On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
- Advances in Cryptology - EUROCRYPT 2004
- SOFSEM 2005: Theory and Practice of Computer Science
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: Boolean functions: degree and support