How Much Can Complexity of Linear Cryptanalysis Be Reduced? (Q2942831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Improvement of Linear Cryptanalysis with Addition Operations with Applications to FEAL-8X / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Time Complexity of Matsui’s Linear Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: FFT Key Recovery for Integral Attack / rank
 
Normal rank

Latest revision as of 17:54, 10 July 2024

scientific article
Language Label Description Also known as
English
How Much Can Complexity of Linear Cryptanalysis Be Reduced?
scientific article

    Statements

    Identifiers