The existence of generalized mix functions

Authors:
Weidong Guo;Gennian Ge
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, People's of Republic of China 310027;Department of Mathematics, Zhejiang University, Hangzhou, People's of Republic of China 310027
Venue:
Designs, Codes and Cryptography
Year:
2009

Citing 3
Cited 1

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Generalized mix functions and orthogonal equitable rectangles

Designs, Codes and Cryptography
How to Enrich the Message Space of a Cipher

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption

On orthogonal generalized equitable rectangles

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

To enrich the message space of a cipher and guarantee security, Ristenpart and Rogaway defined mix functions on two sets of equal size. To mix inputs from two sets of different sizes, Stinson generalized the definition of mix functions (called generalized mix functions), and established an existence result for generalized mix functions with 10 undetermined pairs of input sizes. In this paper, we complete the solution to the existence problem for generalized mix functions.