Massive superpoly recovery with nested monomial predictions
From MaRDI portal
Publication:6157499
DOI10.1007/978-3-030-92062-3_14zbMATH Open1514.94101OpenAlexW3203614282MaRDI QIDQ6157499FDOQ6157499
Authors: Kai Hu, Siwei Sun, Yosuke Todo, Meiqin Wang, Qingju Wang 
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/49480
Recommendations
- Stretching cube attacks: improved methods to recover massive superpolies
- Improved division property based cube attacks exploiting algebraic properties of superpoly
- Improved graph-based model for recovering superpoly on Trivium
- A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers
- A practical key-recovery attack on 805-round Trivium
Cites Work
- Trivium
- New block encryption algorithm MISTY
- Cube Attacks on Tweakable Black Box Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- The block cipher Square
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- Structural Evaluation by Generalized Integral Property
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- Improved division property based cube attacks exploiting algebraic properties of superpoly
- Cube attacks on non-blackbox polynomials based on division property
- An AEAD variant of the Grain stream cipher
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- Bit-Based Division Property and Application to Simon Family
- Degree evaluation of NFSR-based cryptosystems
- Integral Cryptanalysis on Full MISTY1
- A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers
- Another View of the Division Property
- Lower bounds on the degree of block ciphers
- Linearly equivalent s-boxes and the division property
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Modeling for three-subset division property without unknown subset
- Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD
- MILP-aided method of searching division property using three subsets and applications
- Automatic search for a variant of division property using three subsets
- The cube attack on stream cipher Trivium and quadraticity tests
- An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
- A $$2^{70}$$ Attack on the Full MISTY1
Cited In (12)
- An improved method for evaluating secret variables and its application to WAGE
- A new method for searching cubes and its application to 815-round trivium
- Correlation cube attack revisited. Improved cube search and superpoly recovery techniques
- From unbalanced to perfect: implementation of low energy stream ciphers
- More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities
- Improved graph-based model for recovering superpoly on Trivium
- Stretching cube attacks: improved methods to recover massive superpolies
- Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
- Cryptanalysis of reduced round SPEEDY
- A new correlation cube attack based on division property
- Combining MILP modeling with algebraic bias evaluation for linear mask search: improved fast correlation attacks on SNOW
- An experimentally verified attack on 820-round Trivium
This page was built for publication: Massive superpoly recovery with nested monomial predictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157499)
