A simpler model for recovering superpoly on Trivium
From MaRDI portal
Publication:6618593
DOI10.1007/978-3-030-99277-4_13zbMATH Open1547.94351MaRDI QIDQ6618593
Charles Prud'homme, Arthur Gontier, Stéphanie Delaune, Patrick Derbez
Publication date: 14 October 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Degree evaluation of NFSR-based cryptosystems
- Cube attacks on non-blackbox polynomials based on division property
- Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD
- Computing AES related-key differential characteristics with constraint programming
- An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
- Lower bounds on the degree of block ciphers
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
- Structural Evaluation by Generalized Integral Property
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Trivium
- Cube Attacks on Tweakable Black Box Polynomials
- Bit-Based Division Property and Application to Simon Family
Related Items (1)
This page was built for publication: A simpler model for recovering superpoly on Trivium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618593)
