A one-pass mode of operation for deterministic message authentication- security beyond the birthday barrier

Abstract

We present a novel mode of operation which iterates a compression function f:{0,1} n+b →{0,1} n meeting a condition b ≥ 2n. Our construction can be viewed as a way of domain extension, applicable to a fixed-input-length PRF (pseudo-random function) meeting the condition b ≥ 2n, which yields an arbitrary-input-length PRF . Our construction accomplishes both high security (beyond the birthday barrier) and high efficiency (one-pass), with engineering considerations of being stateless, deterministic and single-keyed. © 2008 Springer-Verlag Berlin Heidelberg.