On Cryptographically Significant Mappings over GF(2 n ) (Q3519562): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential cryptanalysis of DES-like cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generalized Linear Equivalence of Functions Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of almost bent and almost perfect nonlinear polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes, bent functions and permutations suitable for DES-like cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of problems in games, graphs and algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affinity of permutations of \(\mathbb F_{2}^{n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374924 / rank
 
Normal rank

Latest revision as of 13:57, 28 June 2024

scientific article
Language Label Description Also known as
English
On Cryptographically Significant Mappings over GF(2 n )
scientific article

    Statements

    On Cryptographically Significant Mappings over GF(2 n ) (English)
    0 references
    19 August 2008
    0 references
    0 references

    Identifiers