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

  • Authors:
  • Mridul Nandi;Wonil Lee;Kouichi Sakurai;Sangjin Lee

  • Affiliations:
  • Applied Statistics Unit, Indian Statistical Institute, Kolkata, India;Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Center for Information Security Technologies (CIST), Korea University, Seoul, Korea

  • Venue:
  • FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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 Ω(22 n/3) queries, where n 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.