Another look at success probability of linear cryptanalysis

DOI10.3934/AMC.2019040MaRDI QIDQ2274241zbMATH OpenOpenAlexWikidataFDO

Authors Subhabrata Samajder, Palash Sarkar

Publication date 19 September 2019

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2019040

zbMATH Keywords

linear cryptanalysisdata complexitysuccess probability

Mathematics Subject Classification ID

Applications of statistics (62P99) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
• On probability of success in linear and differential cryptanalysis
• scientific article; zbMATH DE number 1952897
• Revisiting the wrong-key-randomization hypothesis
• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2

Cited in

(9)

• scientific article; zbMATH DE number 1952897 (Why is no real title available?)
• Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
• Improving linear cryptanalysis of LOKI91 by probabilistic counting method
• How Far Can We Go Beyond Linear Cryptanalysis?
• Another look at key randomisation hypotheses
• Revisiting the wrong-key-randomization hypothesis
• Applications of Simon's algorithm in quantum attacks on Feistel variants
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• On probability of success in linear and differential cryptanalysis

This page was built for publication: Another look at success probability of linear cryptanalysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274241)