Welcome to the resource topic for 2004/010
Title:
Fast Pseudo-Hadamard Transforms
Authors: 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 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.
ePrint: https://eprint.iacr.org/2004/010
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .