Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums (Q946890): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Q174191 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Zlatko G. Varbanov / rank
Normal rank
 

Revision as of 19:53, 19 February 2024

scientific article
Language Label Description Also known as
English
Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums
scientific article

    Statements

    Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums (English)
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    The inverse permutation \(\sigma: x \mapsto x^{-1}\) appears in the design of the AES cryptosystem. This permutation is considered as a very good mapping. In this paper, the authors study the permutation \(\sigma: x \mapsto x^{-1}\) on the field of order \(2^n\) by means of their component functions \(f_\lambda\). It is proved that the weights of derivatives of \(f_\lambda\) can be expressed in terms of Kloosterman sums. The authors compute some indicators of the propagation characteristics of \(\sigma\) \((\mathcal{M}(\sigma)\) and \(\mathcal{V}(\sigma))\) and they prove that the mapping \(\sigma: x \mapsto x^{-1}\) has good propagation characteristics with respect to these indicators. Moreover, they deduce several new formulas on Kloosterman sums, by using classical formulas which link any Boolean function with its derivatives.
    0 references
    inverse permutation
    0 references
    Boolean functions
    0 references
    vectorial mapping
    0 references
    cryptographic criteria
    0 references
    Kloosterman sum
    0 references
    Melas codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references