Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails

DOI10.1007/978-3-319-16745-9_15zbMath1400.94115OpenAlexW250828250MaRDI QIDQ3454589

Wentao Zhang, Zhenzhen Bao, Dong-Dai Lin

Publication date: 25 November 2015

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_15

zbMATH Keywords

optimizationsearch algorithmdifferential cryptanalysislinear cryptanalysisNoekeondifferential traillinear trailSpongent

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Improved (related-key) differential cryptanalysis on GIFT ⋮ Speeding up MILP Aided Differential Characteristic Search with Matsui’s Strategy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128
• Construction of Differential Characteristics in ARX Designs Application to Skein
• PRESENT: An Ultra-Lightweight Block Cipher
• Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others
• Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
• Best differential characteristic search of FEAL
• Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
• SPONGENT: The Design Space of Lightweight Cryptographic Hashing
• Automatic Search for Differential Trails in ARX Ciphers
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails