Mathematical Analysis for a Dynamic Cipher
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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 exaxtly one composite function from the possible 2^16 composite functions. DyC supports 8*n bit key size, 16*m bit block length, and n rounds. We have confirmed that DyC offers security aganinst 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.
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 exaxtly one composite function from the possible 2^16 composite functions. DyC supports 8*n bit key size, 16*m bit block length, and n rounds. We have confirmed that DyC offers security aganinst 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.
참고문헌 (4)
- no, "New types of cryptanalytic atacks using related keys"
- A, "Advances in Cryptology-EUROCRYPT 20 Lecture Notes in Computer Science 1807", pp.~0939, Springer-Verlag
- Jakobsen, "The Interpolation Atack on Block Ciphers Lecture Notes in Computer Science 1267", Springer-Verlag
- Jung, "Analysis for a Block Cipher Based on a NewFrameworkProcedings of the ICIM’01", pp.201~