International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Fast Pseudo-Hadamard Transforms

Authors:
Tom St Denis
Download:
URL: http://eprint.iacr.org/2004/010
Search ePrint
Search Google
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 $2R$ 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.
BibTeX
@misc{eprint-2004-11986,
  title={Fast Pseudo-Hadamard Transforms},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / Pseudo-Hadamard Transform, Branch Analysis, One-Way Hash Function},
  url={http://eprint.iacr.org/2004/010},
  note={ tomstdenis@iahu.ca 12450 received 16 Jan 2004, last revised 2 Feb 2004},
  author={Tom St Denis},
  year=2004
}