Fast Computation of Large Distributions and Its Cryptographic Applications
From MaRDI portal
Publication:5451077
DOI10.1007/11593447_17zbMath1154.94419OpenAlexW1709606117MaRDI QIDQ5451077
Thomas Johansson, Alexander Maksimov
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_17
complexityalgorithmsconvolutionapproximationscryptanalysislarge distributionspseudo-linear functions
Related Items (11)
Walsh transforms and cryptographic applications in bias computing ⋮ Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0 ⋮ Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V ⋮ Linear Distinguishing Attack on Shannon ⋮ Multidimensional linear cryptanalysis ⋮ A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field ⋮ Cryptanalysis of Rabbit ⋮ On Large Distributions for Linear Cryptanalysis ⋮ Linear Approximations of Addition Modulo 2n-1 ⋮ On the best linear approximation of addition modulo \(2^n\) ⋮ Upper bounds on the imbalance of discrete functions implemented by sequences of finite automata
This page was built for publication: Fast Computation of Large Distributions and Its Cryptographic Applications
