Security analysis of a 2/3-rate double length compression function in the black-box model

Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)

Abstract

In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the compression function requires Ω(2 2n/3) queries, where π is the single length output size. Thus, it has better security than a most secure single length compression function. This construction is more efficient than the construction given in [8]. Also the three computations of underlying compression functions can be done in parallel. The proof idea uses a concept of computable message which can be helpful to study security of other constructions like [8], [14], [16] etc.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsH. Gilbert, H. Handschuh
Pages243-254
Number of pages12
Volume3557
Publication statusPublished - 2005
Event12th International Workshop on Fast Software Encryption. FSE 2005 - Paris, France
Duration: 2005 Feb 212005 Feb 23

Other

Other12th International Workshop on Fast Software Encryption. FSE 2005
CountryFrance
CityParis
Period05/2/2105/2/23

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Nandi, M., Lee, W., Sakurai, K., & Lee, S. (2005). Security analysis of a 2/3-rate double length compression function in the black-box model. In H. Gilbert, & H. Handschuh (Eds.), Lecture Notes in Computer Science (Vol. 3557, pp. 243-254)

Security analysis of a 2/3-rate double length compression function in the black-box model. / Nandi, Mridul; Lee, Wonil; Sakurai, Kouichi; Lee, Sangjin.

Lecture Notes in Computer Science. ed. / H. Gilbert; H. Handschuh. Vol. 3557 2005. p. 243-254.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nandi, M, Lee, W, Sakurai, K & Lee, S 2005, Security analysis of a 2/3-rate double length compression function in the black-box model. in H Gilbert & H Handschuh (eds), Lecture Notes in Computer Science. vol. 3557, pp. 243-254, 12th International Workshop on Fast Software Encryption. FSE 2005, Paris, France, 05/2/21.
Nandi M, Lee W, Sakurai K, Lee S. Security analysis of a 2/3-rate double length compression function in the black-box model. In Gilbert H, Handschuh H, editors, Lecture Notes in Computer Science. Vol. 3557. 2005. p. 243-254
Nandi, Mridul ; Lee, Wonil ; Sakurai, Kouichi ; Lee, Sangjin. / Security analysis of a 2/3-rate double length compression function in the black-box model. Lecture Notes in Computer Science. editor / H. Gilbert ; H. Handschuh. Vol. 3557 2005. pp. 243-254
@inproceedings{b518a636f64b4cad848199ea7f92305f,
title = "Security analysis of a 2/3-rate double length compression function in the black-box model",
abstract = "In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the compression function requires Ω(2 2n/3) queries, where π is the single length output size. Thus, it has better security than a most secure single length compression function. This construction is more efficient than the construction given in [8]. Also the three computations of underlying compression functions can be done in parallel. The proof idea uses a concept of computable message which can be helpful to study security of other constructions like [8], [14], [16] etc.",
author = "Mridul Nandi and Wonil Lee and Kouichi Sakurai and Sangjin Lee",
year = "2005",
language = "English",
volume = "3557",
pages = "243--254",
editor = "H. Gilbert and H. Handschuh",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Security analysis of a 2/3-rate double length compression function in the black-box model

AU - Nandi, Mridul

AU - Lee, Wonil

AU - Sakurai, Kouichi

AU - Lee, Sangjin

PY - 2005

Y1 - 2005

N2 - In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the compression function requires Ω(2 2n/3) queries, where π is the single length output size. Thus, it has better security than a most secure single length compression function. This construction is more efficient than the construction given in [8]. Also the three computations of underlying compression functions can be done in parallel. The proof idea uses a concept of computable message which can be helpful to study security of other constructions like [8], [14], [16] etc.

AB - In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the compression function requires Ω(2 2n/3) queries, where π is the single length output size. Thus, it has better security than a most secure single length compression function. This construction is more efficient than the construction given in [8]. Also the three computations of underlying compression functions can be done in parallel. The proof idea uses a concept of computable message which can be helpful to study security of other constructions like [8], [14], [16] etc.

UR - http://www.scopus.com/inward/record.url?scp=26444539878&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26444539878&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:26444539878

VL - 3557

SP - 243

EP - 254

BT - Lecture Notes in Computer Science

A2 - Gilbert, H.

A2 - Handschuh, H.

ER -