An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers (Q5071465): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q121365422, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Differential cryptanalysis of DES-like cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Encryption Standard – AES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Ciphers and Differential Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Attacks Against SPN: A Thorough Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Рассеивающие свойства XSLP-шифров / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and differential cryptanalysis: Another viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact maximum expected differential and linear probability for $2$-round Kuznyechik / rank
 
Normal rank

Latest revision as of 17:21, 28 July 2024

scientific article; zbMATH DE number 7511172
Language Label Description Also known as
English
An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers
scientific article; zbMATH DE number 7511172

    Statements

    An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers (English)
    0 references
    0 references
    21 April 2022
    0 references
    Kuznyechik
    0 references
    SPN
    0 references
    LSX
    0 references
    differential cryptanalysis
    0 references
    MEDP
    0 references
    MELP
    0 references

    Identifiers