In this paper we present a new block cipher over a small finite domain T where |T | = k is either 216 or 232. After that we suggest a use of this cipher for enciphering members of arbitrary small finite domains M where M⊆T. With cost of an extra mapping, this method could be further extended for enciphering in arbitrary domain M′ where |M′ | = k′ ≤ k. At last, in a discussion section we suggest a few interesting usage scenarios for such a cipher as an argument that enciphering with arbitrary small finite domains is a very useful primitive on its own rights, as well as for designing of a higher level protocols.
CITATION STYLE
Pryamikov, V. (2006). Enciphering with arbitrary small finite domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4329 LNCS, pp. 251–265). Springer Verlag. https://doi.org/10.1007/11941378_18
Mendeley helps you to discover research relevant for your work.