A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma

DOI10.1007/3-540-49264-X_3zbMATH Open0973.94522OpenAlexW1564295073MaRDI QIDQ2757230FDOQ2757230

Authors: Carlo Harpes, Gerhard G. Kramer, James L. Massey 

Publication date: 25 November 2001

Published in: Advances in Cryptology — EUROCRYPT ’95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-49264-x_3

Recommendations

• scientific article; zbMATH DE number 1088939
• How Far Can We Go Beyond Linear Cryptanalysis?
• scientific article; zbMATH DE number 1088928
• Publication:4940677
• Partitioning cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (37)

• A geometric approach to linear cryptanalysis
• Partitioning cryptanalysis
• Can a differential attack work for an arbitrarily large number of rounds?
• Title not available (Why is that?)
• Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
• Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
• Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64
• Title not available (Why is that?)
• Another look at normal approximations in cryptanalysis
• Title not available (Why is that?)
• Linear Cryptanalysis of Non Binary Ciphers
• Multidimensional linear cryptanalysis
• Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
• Upper estimates of imbalance of bilinear approximations for round functions of block ciphers
• A Statistical Saturation Attack against the Block Cipher PRESENT
• Provable security of block ciphers against linear cryptanalysis: a mission impossible?
• Capacity and Data Complexity in Multidimensional Linear Attack
• Distinguishing error of nonlinear invariant attacks
• Another look at key randomisation hypotheses
• Nonlinear Invariant Attack
• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
• Rigorous upper bounds on data complexities of block cipher cryptanalysis
• Title not available (Why is that?)
• Information leakage of Feistel ciphers
• The piling-up approximation in linear cryptanalysis
• Multiple differential cryptanalysis: theory and practice
• Revisiting the wrong-key-randomization hypothesis
• A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
• Correlation theorems in cryptanalysis
• Pseudorandom Permutation Families over Abelian Groups
• Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
• A theoretical analysis of generalized invariants of bijective S-boxes
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• Linear cryptanalysis of reduced-round ICEBERG
• Title not available (Why is that?)
• On degree-\(d\) zero-sum sets of full rank
• On quadratic approximations in block ciphers

This page was built for publication: A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma

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