@InProceedings{Riv05c,
author = { Ronald L. Rivest },
title = { Abelian square-free dithering for iterated hash functions },
url = { http://csrc.nist.gov/groups/ST/hash/documents/rivest-asf-paper.pdf },
booktitle = { Proceedings NIST First Cryptographic Hash Workshop },
publisher = { NIST },
date = { 2005-11-01 },
OPTyear = { 2005 },
OPTmonth = { October 31--November 1, },
eventtitle = { HASH'05 },
eventdate = { 2005-10-31/2005-11-01 },
venue = { NIST Gaithersburg, Maryland },
urla = { HASH'05 },
urlb = { related-talk },
abstract = {
We present a novel way of ``dithering'' the operation of an
iterated hash function, based on the notion of square-free sequences (sequences
containing no consecutive repeated subsequences) and on their
generalization to abelian square-free sequences, as a means of defeating
some ``message expansion'' attacks recently proposed by Dean and of
Kelsey and Schneier [Dea99,KS05].
},
}