Fast Software Encryption

DOI10.1007/b93938zbMath1254.94036OpenAlexW2505253445WikidataQ56387660 ScholiaQ56387660MaRDI QIDQ5902490

Pascal Junod, Serge Vaudenay

Publication date: 5 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93938

zbMATH Keywords

Neyman-Pearson lemmalinear cryptanalysisstatistical cryptanalysiskey ranking

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Another look at normal approximations in cryptanalysis ⋮ Correlation attacks on combination generators ⋮ Capability of evolutionary cryptosystems against differential cryptanalysis ⋮ Evolutionary cryptography against multidimensional linear cryptanalysis ⋮ Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity ⋮ Revisiting the wrong-key-randomization hypothesis ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 ⋮ Another look at key randomisation hypotheses ⋮ Accurate estimates of the data complexity and success probability for various cryptanalyses ⋮ On some connections between statistics and cryptology ⋮ New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba ⋮ A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks ⋮ Multidimensional linear cryptanalysis ⋮ On probability of success in linear and differential cryptanalysis ⋮ Linear Cryptanalysis of Non Binary Ciphers ⋮ An overview of distinguishing attacks on stream ciphers ⋮ Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis

This page was built for publication: Fast Software Encryption