Elsner C, Schmidt M (2009)
Publication Language: English
Publication Type: Other publication type
Publication year: 2009
In this paper we show how to use an old mathematical concept of diophantine analysis, the approximation theorem of Kronecker, in symmetric cryptography. As a rst practical application we propose and analyze the new symmetric 128-bit block cipher KronCrypt. The cipher is a 4-round Feistel network with a non-bijective round function f made up of a variable number of large key-dependent S-boxes, XORs and modular additions. Its key length is variable but not less than 128 bit. The main innovation of KronCrypt in the area of symmetric cryptography is the fact that the key-dependent S-boxes are based upon a constructive proof of the approximation theorem of Kronecker used as a boolean function. We prove the correctness of our concept in general and show how we designe the new cipher KronCrypt. Furthermore, results concerning statistical behaviour, i.e. confusion, diusion and completeness, and dierential cryptanalysis are presented.
APA:
Elsner, C., & Schmidt, M. (2009). KronCrypt - A New Symmetric Cryptosystem Based on Kronecker's Approximation Theorem.
MLA:
Elsner, Carsten, and Martin Schmidt. KronCrypt - A New Symmetric Cryptosystem Based on Kronecker's Approximation Theorem. 2009.
BibTeX: Download