Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
From MaRDI portal
Publication:2946893
DOI10.1007/978-3-662-43933-3_26zbMath1321.94058OpenAlexW1467319789MaRDI QIDQ2946893
Thomas Vannet, Pierre-Alain Fouque
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_26
Related Items (19)
Comparison of Cube Attacks Over Different Vector Spaces ⋮ Correlation cube attacks: from weak-key distinguisher to key recovery ⋮ Cube Attack on Stream Ciphers using a Modified Linearity Test ⋮ Higher order differentiation over finite fields with applications to generalising the cube attack ⋮ Some cryptanalytic results on TRIAD ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Conditional Cube Searching and Applications on Trivium-Variant Ciphers ⋮ An experimentally verified attack on 820-round Trivium ⋮ A practical key-recovery attack on 805-round Trivium ⋮ Massive superpoly recovery with nested monomial predictions ⋮ Stretching cube attacks: improved methods to recover massive superpolies ⋮ A polynomial system for bit-based division property solving by quantum algorithm ⋮ Counting Boolean functions with faster points ⋮ The MILP-aided conditional differential attack and its application to Trivium ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ Observing biases in the state: case studies with Trivium and Trivia-SC ⋮ Conditional cube attack on round-reduced River Keyak ⋮ New results on the state cycles of Trivium ⋮ New cube distinguishers on NFSR-based stream ciphers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-testing/correcting with applications to numerical problems
- Breaking Grain-128 with Dynamic Cube Attacks
- Algebraic Side-Channel Attacks
- Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems
- Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
- Algebraic Side-Channel Analysis in the Presence of Errors
- Cube Attacks on Tweakable Black Box Polynomials
- Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA
- Efficient erasure correcting codes
- Good error-correcting codes based on very sparse matrices
- Higher Order Derivatives and Differential Cryptanalysis
- Algorithmic Cryptanalysis
- The Complexity of Testing Monomials in Multivariate Polynomials
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
