Enciphering with arbitrary small finite domains

Authors:
Valery Pryamikov
Affiliations:
Harper Security Consulting, Trondheim, Norway
Venue:
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Year:
2006

Citing 7
Cited 0

Linear cryptanalysis method for DES cipher

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael

The Design of Rijndael
Ciphers with Arbitrary Finite Domains

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
The Block Cipher Square

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Slide Attacks

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
On the Construction of Variable-Input-Length Ciphers

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
The Saturation Attack - A Bait for Twofish

FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new block cipher over a small finite domain where is either 216 or 232 . After that we suggest a use of this cipher for enciphering members of arbitrary small finite domains where . With cost of an extra mapping, this method could be further extended for enciphering in arbitrary domain where . 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.