Fast Pseudo-Hadamard Transforms

Tom St Denis

Paper 2004/010

Fast Pseudo-Hadamard Transforms

Tom St Denis

Abstract

We prove that the fast pseudo-Hadamard transform (FPHT) over a finite field has a bounded branch number. We shall demonstrate that the transform has an efficient implementation for various platforms compared to an equal dimension MDS code. We prove that when using a CS-Cipher\cite{CSC} like construction the weight of any $2 R$ trail is bounded for the case of an $8 \times 8$ transform. We show that the FPHT can also be combined with MDS codes to produce efficient transforms with half of the branch of a comparable sized MDS code. We present the FPHT-HASH one-way hash function which is constructed using a $32 \times 32$ FPHT which produces a $256$ -bit digest and processes the input at 24 cycles per byte with ISO C source code on an AMD Athlon XP processor.

Note: Minor typographical errors fixed.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Pseudo-Hadamard Transform Branch Analysis One-Way Hash Function
Contact author(s): tomstdenis @ iahu ca
History: 2004-02-02: last of 3 revisions; 2004-01-21: received; See all versions
Short URL: https://ia.cr/2004/010
License: CC BY

BibTeX

@misc{cryptoeprint:2004/010,
      author = {Tom St Denis},
      title = {Fast Pseudo-Hadamard Transforms},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/010},
      year = {2004},
      url = {https://eprint.iacr.org/2004/010}
}