Ciphers with arbitrary finite domains
Topics in Cryptology—CT-RSA 2002: The Cryptographers' Track at the RSA …, 2002•Springer
We explore 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]. We see ciphers with
arbitrary domains as a worthwhile primitive in its own right, and as a potentially useful one
for making higher-level protocols.
(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]. We see ciphers with
arbitrary domains as a worthwhile primitive in its own right, and as a potentially useful one
for making higher-level protocols.
Abstract
We explore 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 = 2n, for some n). We look at a few solutions to this problem, focusing on the case when M= [0, k - 1]. We see ciphers with arbitrary domains as a worthwhile primitive in its own right, and as a potentially useful one for making higher-level protocols.
Springer
Showing the best result for this search. See all results