New method for combining Matsui's bounding conditions with sequential encoding method
From MaRDI portal
Publication:6063134
DOI10.1007/s10623-023-01259-9zbMath1526.94044OpenAlexW4383553174MaRDI QIDQ6063134
Bin Hu, Unnamed Author, Jie Guan, Sen Peng Wang, Tairong Shi, Dengguo Feng
Publication date: 7 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01259-9
Mixed integer programming (90C11) Cryptography (94A60) Random number generation in numerical analysis (65C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cube attacks on non-blackbox polynomials based on division property
- MILP-aided method of searching division property using three subsets and applications
- Automatic search of bit-based division property for ARX ciphers and word-based division property
- Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- LBlock: A Lightweight Block Cipher
- Automatic Security Evaluation of Block Ciphers with S-bP Structures Against Related-Key Differential Attacks
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
- Observations on the SIMON Block Cipher Family
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- PRESENT: An Ultra-Lightweight Block Cipher
- MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- A New Method for Searching Optimal Differential and Linear Trails in ARX Ciphers
- GIFT: A Small Present
- New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
- The complexity of theorem-proving procedures
- Speeding up MILP Aided Differential Characteristic Search with Matsui’s Strategy
- Convexity of division property transitions: theory, algorithms and compact models
This page was built for publication: New method for combining Matsui's bounding conditions with sequential encoding method
