Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (Q5447509): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nicholas Kolokotronis / rank
Normal rank
 
Property / author
 
Property / author: Nicholas Kalouptsidis / rank
Normal rank
 
Property / author
 
Property / author: Nicholas Kolokotronis / rank
 
Normal rank
Property / author
 
Property / author: Nicholas Kalouptsidis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77272-9_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1483474036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially-bent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bent and Semi-Bent Quadratic Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability theory of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of Achterbahn / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weight structure of Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weight enumeration of weights less than 2.5d of Reed—Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of semi-bent and bent functions on finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Linear Approximations in Linear Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of difference sets in non-cyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low order approximation of cipher functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ``bent'' functions / rank
 
Normal rank

Latest revision as of 18:38, 27 June 2024

scientific article; zbMATH DE number 5245662
Language Label Description Also known as
English
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
scientific article; zbMATH DE number 5245662

    Statements

    Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (English)
    0 references
    7 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean functions
    0 references
    bent functions
    0 references
    covering radius
    0 references
    second-order nonlinearity
    0 references
    low-order approximations
    0 references
    Reed-Muller codes
    0 references
    0 references