DOI QR코드

DOI QR Code

Evaluation of DES key search stability using Parallel Computing

병렬 컴퓨팅을 이용한 DES 키 탐색 안정성 분석

  • 윤준원 (KISTI 국가슈퍼컴퓨팅연구소) ;
  • 최장원 (KISTI 국가슈퍼컴퓨팅연구소) ;
  • 박찬열 (KISTI 국가슈퍼컴퓨팅연구소) ;
  • 공기식 (남서울대학교 멀티미디어학과)
  • Received : 2013.03.11
  • Accepted : 2013.03.25
  • Published : 2013.03.31

Abstract

Current and future parallel computing model has been suggested for running and solving large-scale application problems such as climate, bio, cryptology, and astronomy, etc. Parallel computing is a form of computation in which many calculations are carried out simultaneously. And we are able to shorten the execution time of the program, as well as can extend the scale of the problem that can be solved. In this paper, we perform the actual cryptographic algorithms through parallel processing and evaluate its efficiency. Length of the key, which is stable criterion of cryptographic algorithm, judged according to the amount of complete enumeration computation. So we present a detailed procedure of DES key search cryptographic algorithms for executing of enumeration computation in parallel processing environment. And then, we did the simulation through applying to clustering system. As a result, we can measure the safety and solidity of cryptographic algorithm.

기상, 바이오, 천문학, 암호학 등 다양한 분야의 대규모 작업을 처리하기 위하여 다수의 계산 자원을 동시에 사용하기 위한 병렬 컴퓨팅 기법들이 제안되어져 왔다. 병렬 컴퓨팅은 여러 프로세서에게 작업을 분담시켜 동시에 계산을 수행하게 함으로써 프로그램의 실행시간을 단축시킬 수 있을 뿐만 아니라 해결할 수 있는 문제의 규모를 확장 시킬 수 있다. 본 논문에서는 실제 암호 알고리즘 분석하기 위하여 병렬 처리 방식을 적용하여 그 효율성을 분석하였다. 암호 알고리즘의 실질적인 안전성 요소인 키의 길이는 전수조사 계산량에 의존한다. 이에 병렬 처리 환경에서 DES 키 탐색 암호 알고리즘의 키 전수조사 작업을 수행하기 위한 세부적인 절차에 대해서 논하였고, 클러스터링 장비에 적용하여 시뮬레이션 수행하였다. 그 결과 컴퓨터의 양에 따라서 계산량의 추이를 실증적으로 예측함으로써 암호 알고리즘의 안전성 강도를 측정할 수 있다.

Keywords

References

  1. Meng, Jiayuan, Raghunathan, Anand, Chakradhar, Srirnat T, Byna, Surendra , "Exploiting the forgiving nature of applications for scalable parallel execution", Parallel & Distributed Processing(IPDPS), pp.1-12, April 2010.
  2. N. Sadashiv, Kumar, S.M.D, "Cluster, grid and cloud computing:A detailed comparison", Computer Science & Education (ICCSE), pp.477-482, July 2011.
  3. Gavril Godza, Valentin Cristea, "Comparative Study of COW and SMP Computer Configurations", Parallel Computing in Electrical Engineering(PARELEC), pp. 205-210, September, 2002.
  4. Xiao Qian, Wang Chengguo, Guo Ge, "The Research of Parallel Computing for Large-Scale Finite Element Model of Wheel/Rail Rolling Contact", Computer Science and Information Technology(ICCSIT), pp. 254-257, July, 2010.
  5. Taejung Park, "CUDA-based Object Oriented Programming Techniques for Efficient Parallel Visualization of 3D Content", Journal of Digital Contents Society Vol.13 No. 2 pp. 169-176, June, 2012. https://doi.org/10.9728/dcs.2012.13.2.169
  6. Fox, Geoffrey C, "Lessons for massively parallel applications on message passing computers", Thirty-Seventh IEEE Computer Society International Conference, CMPCON, pp.103-114, 1992.
  7. Mamidala, Amith R, "Optimizing MPI Collectives UsingEfficient Intra-node Communication Techniques over the Blue Gene/P Supercomputer", Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), pp.771-780, May, 2011.
  8. NIST, FIPS PUB 46-2 : Announcing the Data Encryption Standard (DES)
  9. NIST, FIPS PUB 197:Announcing the Advanced Encryption Standard (AES)

Cited by

  1. Design of Resource Grouping for Desktop Grid Computing and Its Application Methods to Fault-Tolerance vol.14, pp.2, 2013, https://doi.org/10.9728/dcs.2013.14.2.171