Introduction to finite fields and their applications
Introduction to finite fields and their applications
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
A New Version of the Stream Cipher SNOW
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
EME*: extending EME to handle arbitrary-length messages with associated data
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Efficient tweakable enciphering schemes from (block-wise) universal hash functions
IEEE Transactions on Information Theory
Pseudo-random functions and parallelizable modes of operations of a block cipher
IEEE Transactions on Information Theory
A trade-off between collision probability and key size in universal hashing using polynomials
Designs, Codes and Cryptography
Tweakable enciphering schemes using only the encryption function of a block cipher
Information Processing Letters
| Hi-index | 1.01 |
EME is an important mode of operation of a block cipher. It converts an n-bit block cipher into a strong pseudo-random permutation which works on longer length strings. In this short note, we generalize the mixing layer of EME. The generalization is done using a linear map @j from F"2"^"n to itself, where n is the block size of the underlying block cipher. A possible instantiation of @j is using word oriented LFSRs. For n=128, this implementation of @j results in the mixing layer being processed about twice as fast as that in the original EME mode of operation.