On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
From MaRDI portal
Publication:1752540
DOI10.1007/s10623-017-0391-zzbMath1387.94096OpenAlexW2741279980WikidataQ123225991 ScholiaQ123225991MaRDI QIDQ1752540
Publication date: 24 May 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0391-z
Related Items (3)
Cryptanalysis of FlexAEAD ⋮ Settling the mystery of \(Z_{r} = r\) in RC4 ⋮ Dimensionality distinguishers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another look at normal approximations in cryptanalysis
- Improved distinguishers for HC-128
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- Some observations on HC-128
- (Non-)random sequences from (non-)random permutations -- analysis of RC4 stream cipher
- A Practical Attack on Broadcast RC4
- The Stream Cipher HC-128
- New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
- A complete characterization of the evolution of RC4 pseudo random generation algorithm
- Cryptanalysis of the Full Spritz Stream Cipher
- IX. On the problem of the most efficient tests of statistical hypotheses
- Distinguishing Distributions Using Chernoff Information
- Predicting and Distinguishing Attacks on RC4 Keystream Generator
- How Far Can We Go Beyond Linear Cryptanalysis?
- Elements of Information Theory
- On Information and Sufficiency
- Probability: A Graduate Course
This page was built for publication: On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers