The existence of generalized mix functions
暂无分享,去创建一个
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.
[1] Thomas Ristenpart,et al. How to Enrich the Message Space of a Cipher , 2007, IACR Cryptol. ePrint Arch..
[2] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[3] Douglas R. Stinson. Generalized mix functions and orthogonal equitable rectangles , 2007, Des. Codes Cryptogr..