Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
type: Item
instance of: scholarly article
title: Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
zbMATH Open document ID: 1444.94096
author: Subhabrata Samajder
author: Palash Sarkar
published in: Cryptography and Communications
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 62P99
zbMATH DE Number: 6875339
zbMATH Keywords: multidimensional linear cryptanalysis
zbMATH Keywords: multiple linear cryptanalysis
zbMATH Keywords: chi-squared distribution
zbMATH Keywords: success probability
zbMATH Keywords: data complexity
zbMATH Keywords: advantage
MaRDI profile type: Publication
full work available at URL: s12095-017-0257-2
OpenAlex ID: W2759781360
cites work: How Far Can We Go Beyond Linear Cryptanalysis?
cites work: Distinguishing Distributions Using Chernoff Information
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Multiple Differential Cryptanalysis Using LLR and χ 2 Statistics
cites work: Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
cites work: Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
cites work: Integral and Multidimensional Linear Distinguishers with Correlation Zero
cites work: Linear hulls with correlation zero and linear cryptanalysis of block ciphers
cites work: On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
cites work: Zero Correlation Linear Cryptanalysis with Reduced Data Complexity
cites work: Probability distributions of correlation and differentials in block ciphers
cites work: A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
cites work: Multidimensional Extension of Matsui’s Algorithm 2
cites work: Capacity and Data Complexity in Multidimensional Linear Attack
cites work: Q4839745
cites work: Q4434866
cites work: Q4940677
cites work: Q4934705
cites work: Q4940674
cites work: The Independence of Linear Approximations in Symmetric Cryptanalysis
cites work: Rigorous upper bounds on data complexities of block cipher cryptanalysis
cites work: Another look at normal approximations in cryptanalysis
cites work: A new test statistic for key recovery attacks using multiple linear approximations
cites work: On probability of success in linear and differential cryptanalysis
cites work: Approximation theorems of mathematical statistics
cites work: Q4035716
cites work: Q5578669
DOI: 10.1007/S12095-017-0257-2
description: scientific article; zbMATH DE number 6875339