### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science |

Editors | H. Gilbert, H. Handschuh |

Pages | 243-254 |

Number of pages | 12 |

Volume | 3557 |

Publication status | Published - 2005 |

Event | 12th International Workshop on Fast Software Encryption. FSE 2005 - Paris, France Duration: 2005 Feb 21 → 2005 Feb 23 |

### Other

Other | 12th International Workshop on Fast Software Encryption. FSE 2005 |
---|---|

Country | France |

City | Paris |

Period | 05/2/21 → 05/2/23 |

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science.*vol. 3557, pp. 243-254, 12th International Workshop on Fast Software Encryption. FSE 2005, Paris, France, 05/2/21.

}

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 -