EME is a SPRP or strong pseudorandom permutation construction which uses a nonlinear mixing in between two encryption layers. The designers of EME have shown that the construction is not SPRP secure if the mixing layer of EME is replaced by any linear mixing over a binary field. In this paper, we complete their observation by showing SPRP-insecurity even if we have linear mixing over any non-binary prime field. We have some positive result that PRP (pseudorandom permutation) and online PRP security can be achieved for certain types of linear mixing functions. In fact, we fully characterize all those linear mixing for which (online) PRP security is achieved and demonstrate attacks for all other linear mixing functions. © 2014 Springer International Publishing.
CITATION STYLE
Datta, N., & Nandi, M. (2014). Characterization of EME with linear mixing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8639 LNCS, pp. 221–239). Springer Verlag. https://doi.org/10.1007/978-3-319-09843-2_17
Mendeley helps you to discover research relevant for your work.