Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

MDS code Creation Confirmation Algorithms in Permutation Layer of a Block Cipher

블록 암호에서 교환 계층의 MDS 코드 생성 확인 알고리즘

  • 박창수 (부경대학교 전자컴퓨터정보통신공학부 컴퓨터공학과) ;
  • 조경연 (부경대학교 전자컴퓨터정보통신공학부)
  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

정보통신의 발달과 인터넷의 확산으로 인해 정보보안의 필요성이 증대되면서 다양한 암호알고리즘이 개발되어 활용되고 있다. 이와 더불어 암호 공격 기술도 발전하여서, 공격에 강한 알고리즘에 대한 연구가 활발하게 진행되고 있다. Substitution Permutation Networks(SPN)등의 블록 암호알고리즘에서 교환계층의 선형변환행렬이 Maximum Distance Separable(MDS) 코드를 생성하면 차분공격과 선형공격에 강한 특성을 보인다. 본 논문에서는 선형변환행렬이 MDS 코드를 생성하는가를 판단하는 새로운 알고리즘을 제안한다. 선행변환행렬의 입력코드는 GF(2$^n$)상의 원소들로 이들을 변수로 해석할 수 있다. 하나의 변수를 다른 변수들의 대수식으로 변환하고 대입하여 변수를 하나씩 소거한다. 변수가 하나이고 모든 계수가 ‘0’이 아니면 선형변환 행렬은 MDS 코드를 생성한다. 본 논문에서 제안한 알고리즘은 기존의 모든 정방부분행렬이 정칙인지를 판단하는 알고리즘과 비교하여 곱셈 및 역수 연산수를 많이 줄임으로서 수행 시간을 크게 감소 시켰다.

Keywords

References

  1. 한국정보보호센터, '128 비트 블록 암호 알고리즘(SEED) 개발 및 분석보고서', Dec. 1998
  2. E. Biham and A. Shamir, 'Differential cryptanalysis of DES-like crytosystems, Journal of Cryptology', vol. 4, no. 1, pp. 3-72, 1991 https://doi.org/10.1007/BF00630563
  3. M. Matsui, 'The first experimental cryptanalysis of the Data Encryption Standard, Advances in Cryptology', Proc. Of EUROCRYPT '91, Springer-Verlag, Berlin, pp. 1-11, 1994
  4. H.M. Heys and S.E. Tavares, 'The design of substitution-permutation networks resistant to differential and linear cryptanalysis', Proceedings of 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, pp. 148-155, 1994
  5. H.M. Heys and S.E. Tavares, 'The design of product ciphers resistant to differential and linear cryptanalysis', Journal of Cryptology, Vol. 9, no. 1, pp. 1-19, 1996 https://doi.org/10.1007/BF02254789
  6. F.J. MacWilliams and N.J.A. Sloane, 'The theory of error correcting codes', North-Holland Publishing Company, 1977
  7. S. Vaudenay, 'On the need for multipermutations: Crytanalysis of MD4 and SAFER', Proc. of Fast Software Encryption (2), LNCS 1008, Springer-Verlag, pp. 286-297, 1995
  8. V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, 'The cipher SHARK', Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, pp. 99-112, 1996
  9. J. Daemen, L. Knudsen, and V. Rijmen, 'The block cipher SQUARE', Proc. of Fast Software Encryption (4), LNCS, Springer-Verlag, 1997
  10. Luke O'Connor, 'On the Distribution of Characteristics in Bijective Mapping,' Advances in Cryptology, Proc. of EuroCrypt' 93, Springer-Verlag, pp. 99-112, 1996
  11. Ju-Sung Kang, Choonsik Park, Sangjin Lee, and Jong-In Lim, 'On the Optimal Diffusion Layers with Practical Security against Differential and Linear Cryptanalysis', Proceedings of ICISC'99, LNCS 1787, Spring-Verlag pp. 33-52, 1999
  12. A.M. Youssef and S.E. Tavares, 'Resistance of Balanced S-boxes to Linear and Differential Crypanalysis,' Information Processing Letters, Vol. 56, pp. 249-252, 1995 https://doi.org/10.1016/0020-0190(95)00156-6
  13. 박창수, 조경연, 송홍복, 'SEED 형식 암호에서 공격에 강한 S 박스와 G 함수의 실험적설계', 한국해양정보통신학회, TBD
  14. A.M. Youssef, S. Mister, S.E. Tavares, 'On the Design of Linear Transformation for Substitution Permutation Encryption Netw-orks', in the Workshop Record of the Workshop on Selected Areas in Cryptography(SAC '97), pp. 40-48, Aug. 11-12, 1997