A Parallelizable Enciphering Mode (2003)
Cached
Download Links
- [eprint.iacr.org]
- [www.cs.ucdavis.edu]
- [seclab.cs.ucdavis.edu]
- [eprint.iacr.org]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. RSA Conference 2004 – Cryptographer’s Track |
| Citations: | 32 - 1 self |
BibTeX
@INPROCEEDINGS{Halevi03aparallelizable,
author = {Shai Halevi and Phillip Rogaway},
title = {A Parallelizable Enciphering Mode},
booktitle = {Proc. RSA Conference 2004 – Cryptographer’s Track},
year = {2003},
pages = {292--304},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a block-cipher mode of operation, EME, that turns an n-bit block cipher into a tweakable enciphering scheme that acts on strings of mn bits, where m 2 [1::n]. The mode is parallelizable, but as serial-ecient as the non-parallelizable mode CMC [6]. EME can be used to solve the disk-sector encryption problem. The algorithm entails two layers of ECB encryption and a \lightweight mixing" in between. We prove EME secure, in the reduction-based sense of modern cryptography. We motivate some of the design choices in EME by showing that a few simple modi cations of this mode are insecure.
Citations
No citations identified.
