Convexity of division property transitions: theory, algorithms and compact models
From MaRDI portal
Publication:6157497
DOI10.1007/978-3-030-92062-3_12zbMath1514.94134WikidataQ119496618 ScholiaQ119496618MaRDI QIDQ6157497
No author found.
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprint.iacr.org/2021/1285
Related Items (3)
New method for combining Matsui's bounding conditions with sequential encoding method ⋮ On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC ⋮ Mathematical aspects of division property
Cites Work
- Unnamed Item
- Finding integral distinguishers with ease
- Linearly equivalent s-boxes and the division property
- Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD
- SAT competition 2020
- An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
- Lower bounds on the degree of block ciphers
- A $$2^{70}$$ Attack on the Full MISTY1
- Another View of the Division Property
- Structural Evaluation by Generalized Integral Property
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- On the Influence of the Algebraic Degree of $F^{-1}$ on the Algebraic Degree of $G \circ F$
- The LED Block Cipher
- A Way to Simplify Truth Functions
- Integral Cryptanalysis on Full MISTY1
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Security of Sequential Multiple Encryption
- New block encryption algorithm MISTY
- Bit-Based Division Property and Application to Simon Family
- Handling Vectorial Functions by Means of Their Graph Indicators
- Graph Indicators of Vectorial Functions and Bounds on the Algebraic Degree of Composite Functions
This page was built for publication: Convexity of division property transitions: theory, algorithms and compact models