Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Speeding up the Wide-Pipe: Secure and Fast Hashing

Published

Author(s)

Mridul Nandi, Souradyuti Paul

Abstract

In this paper we propose a new sequential mode of operation – the Fast wide pipe or FWP for short - to hash messages of arbitrary length. The mode is shown to be (1) preimage-resistance preserving, (2) collision-resistance-preserving and, most importantly, (3) indifferentiable from a random oracle up to O(2^n/2) compression function invocations. In addition, our rigorous investigation suggests that any variants of Joux's multi-collision, Kelsey-Schneier 2nd preimage and Herding attack are also ineffective on this mode. This fact leads us to conjecture that the indifferentiability security bound of FWP can be extended beyond the birthday barrier. From the point of view of efficiency, this new mode, for example, is always faster than the Wide-pipe mode when both modes use an identical compression function. In particular, it is nearly twice as fast as the Wide-pipe for a reasonable selection of the input and output size of the compression function. We also compare the FWP with several other modes of operation.
Proceedings Title
Progress in Cryptology - INDOCRYPT 2010 (Lecture Notes in Computer Science)
Conference Dates
December 12-15, 2010
Conference Location
Hyderabad
Conference Title
11th International Conference on Cryptology in India (INDOCRYPT 2010)

Keywords

block ciphers, hash functions, indifferentiability, stream ciphers, wide-pipe

Citation

Nandi, M. and Paul, S. (2010), Speeding up the Wide-Pipe: Secure and Fast Hashing, Progress in Cryptology - INDOCRYPT 2010 (Lecture Notes in Computer Science), Hyderabad, -1, [online], https://doi.org/10.1007/978-3-642-17401-8_12 (Accessed April 20, 2024)
Created December 12, 2010, Updated November 10, 2018