Monte Carlo tree search for automatic differential characteristics search: application to SPECK

DOI10.1007/978-3-031-22912-1_17zbMath1519.94048OpenAlexW4313335093MaRDI QIDQ6169475

Matteo Protopapa, David Gérault, Matteo Rossi, Emanuele Bellini

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22912-1_17

zbMATH Keywords

SPECKblock ciphersdifferential cryptanalysisMonte Carlo tree searchARX

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• Depth-first iterative-deepening: An optimal admissible tree search
• Automatic tool for searching for differential characteristics in ARX ciphers and applications
• Improved Differential Cryptanalysis of Round-Reduced Speck
• Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA
• Differential Analysis of Block Ciphers SIMON and SPECK
• The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
• Markov Ciphers and Differential Cryptanalysis
• MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck
• Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck
• A New Method for Searching Optimal Differential and Linear Trails in ARX Ciphers
• Automatic Search for Differential Trails in ARX Ciphers

This page was built for publication: Monte Carlo tree search for automatic differential characteristics search: application to SPECK