### Ciphers with Arbitrary Finite Domains

John Black and Phillip Rogaway

##### 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]$.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
CiphersModes of OperationProvable securitySymmetric Encryption
Contact author(s)
jrb @ unr edu
History
Short URL
https://ia.cr/2001/012

CC BY

BibTeX

@misc{cryptoeprint:2001/012,
author = {John Black and Phillip Rogaway},
title = {Ciphers with Arbitrary Finite Domains},
howpublished = {Cryptology ePrint Archive, Paper 2001/012},
year = {2001},
note = {\url{https://eprint.iacr.org/2001/012}},
url = {https://eprint.iacr.org/2001/012}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.