Parallel SAT framework to find clustering of differential characteristics and its applications

DOI10.1007/978-3-031-53368-6_20MaRDI QIDQ6620061

Ryoma Ito, Takanori Isobe, Kosei Sakamoto

Publication date: 16 October 2024

zbMATH Keywords

differentialincremental SAT problemlow-latency primitivesSAT-based automatic search

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• PRINCEv2. More security for (almost) no overhead
• The \textsf{Simeck} family of lightweight block ciphers
• Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis
• Midori: A Block Cipher for Low Energy
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Differential Analysis of Block Ciphers SIMON and SPECK
• Multiple Differential Cryptanalysis of Round-Reduced PRINCE
• Observations on the SIMON Block Cipher Family
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Markov Ciphers and Differential Cryptanalysis
• A Brief Comparison of Simon and Simeck
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• The complexity of theorem-proving procedures
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Parallel SAT framework to find clustering of differential characteristics and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620061)