Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis

DOI10.1016/J.CAM.2013.10.020zbMATH Open1338.94067OpenAlexW1985769215MaRDI QIDQ2349643FDOQ2349643

Authors: Andrey Bogdanov, Elif Bilge Kavun, Elmar Tischhauser, Tolga Yalçın 

Publication date: 17 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.020

Recommendations

• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
• Experimenting linear cryptanalysis
• Linear cryptanalysis of DES with asymmetries
• On linear cryptanalysis with many linear approximations
• How Much Can Complexity of Linear Cryptanalysis Be Reduced?

zbMATH Keywords

linear cryptanalysisblock ciphersdata complexitywrong key randomization hypothesis

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• On probability of success in linear and differential cryptanalysis
• A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability distributions of correlation and differentials in block ciphers
• Optimal key ranking procedures in a statistical cryptanalysis.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Another look at key randomisation hypotheses
• Revisiting the wrong-key-randomization hypothesis
• Accurate estimates of the data complexity and success probability for various cryptanalyses

This page was built for publication: Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis

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