Rectangle Attacks on 49-Round SHACAL-1

Eli Biham; Orr Dunkelman; N. Keller

Rectangle Attacks on 49-Round SHACAL-1

Eli Biham, Orr Dunkelman, N. Keller

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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 present rectangle attacks on 49 rounds out of the 80 rounds of SHACAL-1. The attacks require 2151.9 chosen plaintexts or ciphertexts and have time complexity of 2508.5 49-round SHACAL-1 encryptions. These are the best known attacks against SHACAL-1. In this paper we also identify and fix some flaws in previous attacks on SHACAL-1.

Original language	American English
Title of host publication	Fast Software Encryption
Editors	Thomas Johansson
Place of Publication	Berlin Heidelberg
Publisher	Springer
Pages	22-35
Volume	2887
State	Published - 2003

Publication series

Name	Lecture Notes in Computer Science

Cite this

@inbook{1d2fd9d4ba6d4030aa6bc2916959b92f,

title = "Rectangle Attacks on 49-Round SHACAL-1",

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 present rectangle attacks on 49 rounds out of the 80 rounds of SHACAL-1. The attacks require 2151.9 chosen plaintexts or ciphertexts and have time complexity of 2508.5 49-round SHACAL-1 encryptions. These are the best known attacks against SHACAL-1. In this paper we also identify and fix some flaws in previous attacks on SHACAL-1.",

author = "Eli Biham and Orr Dunkelman and N. Keller",

year = "2003",

language = "American English",

volume = "2887",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "22--35",

editor = "Thomas Johansson",

booktitle = "Fast Software Encryption",

}

TY - CHAP

T1 - Rectangle Attacks on 49-Round SHACAL-1

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, N.

PY - 2003

Y1 - 2003

N2 - 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 present rectangle attacks on 49 rounds out of the 80 rounds of SHACAL-1. The attacks require 2151.9 chosen plaintexts or ciphertexts and have time complexity of 2508.5 49-round SHACAL-1 encryptions. These are the best known attacks against SHACAL-1. In this paper we also identify and fix some flaws in previous attacks on SHACAL-1.

AB - 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 present rectangle attacks on 49 rounds out of the 80 rounds of SHACAL-1. The attacks require 2151.9 chosen plaintexts or ciphertexts and have time complexity of 2508.5 49-round SHACAL-1 encryptions. These are the best known attacks against SHACAL-1. In this paper we also identify and fix some flaws in previous attacks on SHACAL-1.

UR - http://link.springer.com/chapter/10.1007/978-3-540-39887-5_3

M3 - Chapter

VL - 2887

T3 - Lecture Notes in Computer Science

SP - 22

EP - 35

BT - Fast Software Encryption

A2 - Johansson, Thomas

PB - Springer

CY - Berlin Heidelberg

ER -

Rectangle Attacks on 49-Round SHACAL-1

Abstract

Publication series

Other files and links

Fingerprint

Cite this