CryptoDB
How to Enrich the Message Space of a Cipher
Authors: | |
---|---|
Download: | |
Abstract: |
Given (deterministic) ciphers $\calE$ and~$E$ that can encipher messages of $\el$ and $n$ bits, respectively, we construct a cipher~$\calE^*=XLS[\calE,E]$ that can encipher messages of $\el+s$ bits for any $s |
BibTeX
@misc{eprint-2007-13391, title={How to Enrich the Message Space of a Cipher}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / Deterministic encryption, enciphering scheme, symmetric encryption, length-preserving encryption, multipermutation}, url={http://eprint.iacr.org/2007/109}, note={Preliminary version appears in FSE 2007. tristenp@cs.ucsd.edu 13597 received 25 Mar 2007}, author={Thomas Ristenpart and Phillip Rogaway}, year=2007 }