Ciphers with Arbitrary Finite Domains
CT-RSA, pp. 114-130, 2002.
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= [O, k - 1...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)