Paper 2007/226 Original: eprint.iacr.org/2007/226 ↗
Generalized mix functions and orthogonal equitable rectangles
Abstract
Ristenpart and Rogaway defined "mix" functions, which are used to mix inputs from two sets of equal size, and produce outputs from the same two sets, in an optimal way. These functions have a cryptographic application in the context of extending the domain of a block cipher. It was observed that mix functions could be constructed from orthogonal latin squares. In this paper, we give a simple, scalable construction for mix functions. We also consider a generalization of mix functions, in which the two sets need not be of equal size. These generalized mix functions turn out to be equivalent to an interesting type of combinatorial design which has not previously been studied. We term these "orthogonal equitable rectangles" and we construct them for all possible parameter situations, with a small number of exceptions and possible exceptions.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2007-08-21: last updated
- 2007-06-19: published
- Short URL
- https://ia.cr/2007/226
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/226,
author = {Douglas R. Stinson},
title = {Generalized mix functions and orthogonal equitable rectangles},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/226},
year = {2007},
url = {https://eprint.iacr.org/2007/226}
}