Abstract
SHACAL-1 is a 160-bit block cipher with variable key length of up to 512-bit key based on the hash function SHA-1. It was submitted to the NESSIE project and was accepted as a finalist for the 2nd phase of the evaluation. In this paper we devise the first known attack on the full 80-round SHACAL-1 faster than exhaustive key search. The related-key differentials used in the attack are based on transformation of the collision-producing differentials of SHA-1 presented by Wang et al. © Springer-Verlag Berlin Heidelberg 2007.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Dunkelman, O., Keller, N., & Kim, J. (2007). Related-key rectangle attack on the full SHACAL-1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4356 LNCS, pp. 28–44). Springer Verlag. https://doi.org/10.1007/978-3-540-74462-7_3
Readers' Seniority
Readers' Discipline
