New cube distinguishers on NFSR-based stream ciphers
From MaRDI portal
Publication:2285784
DOI10.1007/S10623-019-00674-1zbMath1428.94080OpenAlexW2973095922WikidataQ121686901 ScholiaQ121686901MaRDI QIDQ2285784
Willi Meier, Santanu Sarkar, Dibyendu Roy, Abhishek Kesarwani
Publication date: 9 January 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00674-1
Related Items (5)
Some cryptanalytic results on TRIAD ⋮ A practical key-recovery attack on 805-round Trivium ⋮ Distinguishing error of nonlinear invariant attacks ⋮ An improved degree evaluation method of NFSR-based cryptosystems ⋮ New general framework for algebraic degree evaluation of NFSR-based cryptosystems
Uses Software
Cites Work
- Observing biases in the state: case studies with Trivium and Trivia-SC
- Correlation cube attacks: from weak-key distinguisher to key recovery
- Improved division property based cube attacks exploiting algebraic properties of superpoly
- Degree evaluation of NFSR-based cryptosystems
- A key-recovery attack on 855-round Trivium
- A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers
- Conditional differential cryptanalysis for Kreyvium
- Conditional Differential Cryptanalysis of Trivium and KATAN
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
- Greedy Distinguishers and Nonrandomness Detectors
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers
- Trivium
- Cube Attacks on Tweakable Black Box Polynomials
- Cube Attacks on Non-Blackbox Polynomials Based on Division Property
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
This page was built for publication: New cube distinguishers on NFSR-based stream ciphers
