Non-linear approximations in linear cryptanalysis

DOI10.1007/3-540-68339-9_20zbMATH Open1304.94069OpenAlexW2057524374MaRDI QIDQ2876902FDOQ2876902

Authors: Matthew J. B. Robshaw, Lars R. Knudsen 

Publication date: 20 August 2014

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

Full work available at URL: https://doi.org/10.1007/3-540-68339-9_20

Recommendations

• Publication:4940677
• scientific article; zbMATH DE number 1455103
• On linear cryptanalysis with many linear approximations
• Improving linear cryptanalysis of LOKI91 by probabilistic counting method
• scientific article; zbMATH DE number 1024103

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (36)

• A geometric approach to linear cryptanalysis
• Can a differential attack work for an arbitrarily large number of rounds?
• Title not available (Why is that?)
• SEA: A Scalable Encryption Algorithm for Small Embedded Applications
• On third-order nonlinearity of biquadratic monomial Boolean functions
• Improving linear cryptanalysis of LOKI91 by probabilistic counting method
• Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64
• On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
• Title not available (Why is that?)
• Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
• The lower bounds on the second-order nonlinearity of three classes of Boolean functions
• Linear Cryptanalysis of Non Binary Ciphers
• Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
• Nonlinearity measures of random Boolean functions
• Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
• Using tools from error correcting theory in linear cryptanalysis
• Higher-order nonlinearity of Kasami functions
• On the second-order nonlinearity of the hidden weighted bit function
• Distinguishing error of nonlinear invariant attacks
• New Results in Linear Cryptanalysis of RC5
• Title not available (Why is that?)
• Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions
• Third-order nonlinearities of a subclass of Kasami functions
• A family of trapdoor ciphers
• On the lower bounds of the second order nonlinearities of some Boolean functions
• The piling-up approximation in linear cryptanalysis
• Title not available (Why is that?)
• On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
• A theoretical analysis of generalized invariants of bijective S-boxes
• Title not available (Why is that?)
• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
• A new lower bound on the second-order nonlinearity of a class of monomial bent functions
• On degree-\(d\) zero-sum sets of full rank
• On quadratic approximations in block ciphers
• Title not available (Why is that?)
• A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions

This page was built for publication: Non-linear approximations in linear cryptanalysis

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