Paper 2004/026

The CSQUARE Transform

Tom St Denis

Abstract

In this paper we show how to combine the design concepts of the SQUARE and CS block ciphers to produce a pseudo-random permutation CSQUARE suitable for use in block cipher and hash design with a very high multi-round trail weight. The new design inherits the hardware efficiency of the SQUARE linear transform pattern as well as the efficiency of the fast pseudo-Hadamard transform over a finite field. We demonstrate the DMWT hash function which makes use of our new results.

Note: Revised: Feb 2nd, 2004

Metadata
Available format(s)
PDF PS
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Pseudo-Hadamard TransformBranch AnalysisPseudo-Random Permutations
Contact author(s)
tomstdenis @ iahu ca
History
2004-02-02: revised
2004-02-02: received
See all versions
Short URL
https://ia.cr/2004/026
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/026,
      author = {Tom St Denis},
      title = {The CSQUARE Transform},
      howpublished = {Cryptology ePrint Archive, Paper 2004/026},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/026}},
      url = {https://eprint.iacr.org/2004/026}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.