Cnf characterization of sets over Z₂^n and its applications in cryptography
From MaRDI portal
Publication:6950559
Cites work
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
- 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
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Differential cryptanalysis of DES-like cryptosystems
- scientific article; zbMATH DE number 3902554 (Why is no real title available?)
- scientific article; zbMATH DE number 1088930 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck
- Observations on the \textsf{SIMON} block cipher family
- The Problem of Simplifying Truth Functions
- Theory and Applications of Satisfiability Testing
Cited in
(1)
This page was built for publication: Cnf characterization of sets over \(\mathbb{Z}_2^n\) and its applications in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950559)
