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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ristenpart T., Rogaway P.: How to enrich the message space of a cipher. Lecture Notes in Computer Science, vol. 4593, pp. 101–118 (Fast Software Encryption, FSE 2007).
Stinson D.R.: Generalized mix functions and orthogonal equitable rectangles. Des. Codes Cryptogr. 45, 347–357 (2007)
Colbourn C.J., Dinitz J.H.: The CRC Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall/CRC (2007).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Huaxiong Wang.
Rights and permissions
About this article
Cite this article
Guo, W., Ge, G. The existence of generalized mix functions. Des. Codes Cryptogr. 50, 107–113 (2009). https://doi.org/10.1007/s10623-008-9217-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9217-3