Mathematical Analysis for a Dynamic Cipher
Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics / Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics, (P)3059-0604; (E)3059-1309
2005, v.12 no.2, pp.143-152
JUNG YOON-TAE
CHOI EUN-HEE
RIM KWANG-CHEOL
JUNG,
Y.
, CHOI,
E.
, &
RIM,
K.
(2005). Mathematical Analysis for a Dynamic Cipher, 12(2), 143-152.
Abstract
We present a new block cipher called DyC. It consists of four sets (procedures) having the different $2^2,\;2^2,\;2^4$, and $2^8$ one-to-one correspondence functions as the elements. The round key is used to determine exactly one composite function from the possible $2^{16}$ composite functions. DyC supports 8 $\times$ n bit key size, 16 $\times$ m bit block length, and n rounds. We have confirmed that DyC offers security against other well-known advanced cryptanalytic attacks including the slide attacks and interpolation attacks. In this paper, we show several properties of the key schedule of DyC by mathematical analysis.
- keywords
-
block cipher,
dynamic cipher,
key dependent,
linear cryptanalysis