Abstract

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 ψ from F 2 n to itself, where n is the block size of the underlying block cipher. A possible instantiation of ψ is using word oriented LFSRs. For n = 128 , this implementation of ψ results in the mixing layer being processed about twice as fast as that in the original EME mode of operation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.