[Resource Topic] 2001/012: Ciphers with Arbitrary Finite Domains

Welcome to the resource topic for 2001/012

Ciphers with Arbitrary Finite Domains

Authors: John Black, Phillip Rogaway


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

ePrint: https://eprint.iacr.org/2001/012

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .