A Heuristic for Finding Compatible Differential Paths with Application to HAS-160

DOI10.1007/978-3-642-42045-0_24zbMATH Open1326.94104OpenAlexW218666475MaRDI QIDQ2867170FDOQ2867170

Authors: Aleksandar Kircanski, Riham AlTawy, A. M. Youssef 

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_24

Recommendations

• The compressed differential heuristic
• A heuristic approach to hard constrained shortest path problems
• scientific article; zbMATH DE number 6519724
• Heuristics for the bi-objective path dissimilarity problem
• scientific article; zbMATH DE number 2209882
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
• Heuristics for finding a maximum number of disjoint bounded paths
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Heuristics for Flexible CMP Synthesis

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (2)

• Searching for Differential Paths in MD4
• Information Security and Cryptology - ICISC 2005

Uses Software

• ARXtools

This page was built for publication: A Heuristic for Finding Compatible Differential Paths with Application to HAS-160

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