CryptoDB
Ciphers with Arbitrary Finite Domains
Authors: | |
---|---|
Download: | |
Abstract: | We introduce the problem of enciphering members of a finite set $M$ where $k=|M|$ is arbitrary (in particular, it need not be a power of two). We want to achieve this goal starting from a block cipher (which requires a message space of size $N=2^n$, for some $n$). We look at a few solutions to this problem, focusing on the case when $M=[0, k-1]$. |
BibTeX
@misc{eprint-2001-11424, title={Ciphers with Arbitrary Finite Domains}, booktitle={IACR Eprint archive}, keywords={Ciphers, Modes of Operation, Provable security, Symmetric Encryption}, url={http://eprint.iacr.org/2001/012}, note={ jrb@unr.edu 11370 received 17 Feb 2001}, author={John Black and Phillip Rogaway}, year=2001 }