전자공학회논문지 (Journal of the Institute of Electronics and Information Engineers)

  • 제50권2호
  • /
  • Pages.70-79
  • /
  • 2013
  • /
  • 2287-5026(pISSN)
  • /
  • 2288-159X(eISSN)
대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지
DOI QR코드

DOI QR Code

이동 Ad-Hoc 네트워크 환경에서 페어링 연산의 밀러 알고리듬에 대한 데이터 오류 공격

A Data Fault Attack on the Miller Algorithm for Pairing Computation in Mobile Ad-Hoc Network Environments

  • 배기석 (경북대학교 전자전기컴퓨터학부) ;
  • 손교용 (대구교육대학) ;
  • 박영호 (경북대학교 산업전자공학과) ;
  • 문상재 (경북대학교 전자전기컴퓨터학부)
  • 투고 : 2012.08.13
  • 발행 : 2013.02.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

최근 이동 ad hoc 네트워크에 적합한 ID 기반의 암호시스템 구현을 위해서 다양한 페어링 연산들이 사용되고 있으며, 밀러 알고리듬은 Weil, Tate, Ate 페어링 연산에서 가장 많이 사용되는 알고리듬이다. 본 논문에서는 Whelan과 Scott에 의해 제안된 밀러 알고리듬의 중간 값에 대한 오류 공격을 구체화하여 라운드 위치와 상관없이 적용할 수 있는 데이터 오류 주입 공격의 가능성을 분석하였다. 시뮬레이션 결과, 제안하는 공격 방법이 라운드 위치나 사용하는 좌표계와 관계없이 적용 가능하여 효과적이며 강력한 오류 주입 공격 방법임을 확인하였다.

Recently, there has been introduced various types of pairing computations to implement ID based cryptosystem for mobile ad hoc network. The Miller algorithm is the most popular algorithm for the typical pairing computation such as Weil, Tate and Ate. In this paper, we analyze the feasibility of concrete data fault injection attack, which was proposed by Whelan and Scott, in terms of regardless of round positions during the execution of the Miller algorithm. As the simulation results, the proposed attack that can be employed to regardless of round positions and coordinate systems is effective and powerful.

키워드

참고문헌

  1. L. Zhou, and Z. J. Haas, "Securing ad hoc networks," IEEE Network megazine, vol.13, no.6, pp. 24-30, November/December 1999.
  2. A. Khalili, J. Katz, and W.A. Arbaugh, "Toward secure key distribution in truly ad-hoc networks," In IEEE Workshop : Security and Assurance in Ad hoc Networks, pp. 342-346, 2003.
  3. Tae Hyun KIM, Tsuyoshi Takagi, Dong-Guk Han, Ho Won Kim, and Jongin Lim, "Power Analysis Attacks and Countermeasures on ηT Pairing over Binary Fields," ETRI Journal, vol.30, no.1, pp. 68-80, Feb. 2009.
  4. N.E. Mrabet, M.L. Flottes, and G. D. Natale, "A practical Differential Power Analysis attack against the Miller algorithm," Research in Microelectronics and Electronics, PRIME 2009. Ph.D., pp.308-311, July 2009.
  5. N.E. Mrabet, "Fault Attacks against the Miller's Algorithm in Edwards Coordinates," In Information Security and Assurance(ISA 2010), pp. 72-85, Miyazaki, Japan, June 2010.
  6. S. Ghosh, D. Mukhopadhyay, and D. R. Chowdhury, "Fault Attack and Countermeasures on Pairing Based Cryptography," Internation Journal of Network Security, vol.12, no.1, pp. 26-33, Jan. 2011.
  7. D. Page and F. Vercauteren, "A Fault Attack on Pairing Based Cryptography," IEEE Transactions on Computers, vol.55, no.9, pp. 1075-1080, 2006. https://doi.org/10.1109/TC.2006.134
  8. C. Whelan and M. Scott, "The Importance of the Final exponentiation in Pairing when considering Fault Attacks," Proc. of Pairing 2007, pp.225-246, Tokyo, Japan, July 2007.
  9. J. Siverman, "The Arithmetic of Elliptic Curves," Springer-Verlag, 1991.
  10. E. Brier, M. Joye, Point multiplication on elliptic curves through isogenies, Proc. of AAECC 2003, LNCS 2643, pp.43-50, 2003.
  11. J.C.Bajard and N.E. Marbet, "Pairing in Cryptography: an arithmetic point of view," Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, part of SPIE, August 2007
  12. N. E. Mrabet, "What about Vulnerability to a Fault Attack of the Miller's Algorithm During an Identity Based Protocol?," In Information Security and Assurance(ISA 2009), pp. 122-134, Seoul, Korea, June 2009.
  13. J.-M. Schmidt and M. Hutter, "Optical and EM Fault-Attacks on CRTbased RSA: Concrete Results," in Austrochip 2007, pp. 61-67, Graz, Austria, Oct. 2007.
  14. E. Trichina and R. Korkikyan. "Multi fault laser attacks on protected CRT-RSA," In FDTC 2010, pp. 75-86, Santa Barbara, USA, Aug. 2010.
  15. S. Lang, Algebra, Rev. 3rd Ed., Graduate Texts in Mathematics, Springer-Verlag, 2002.
  16. D. J. Bernstein and T. Lange. "Faster addition and doubling on elliptic curves," Advanced in Cryptology - ASIACRYPT 2007, pp. 29-50, Kuching, Malaysia, Dec. 2007.
  17. C. Arene, T. Lange, M. Naehrig and C. Ritzenthaler, "Faster computation of the Tate pairing," Journal of Number Theory, vol.131, no.5, pp. 842-857, May 2011. https://doi.org/10.1016/j.jnt.2010.05.013
  18. M. Maas, Pairing-Based Cryptography, Master Thesis, Technische Universiteit Eindhoven, 2004.
  19. Mathematica, http://www.wolfram.com/products/mathematica/in dex.html

피인용 문헌

  1. A Proposal for Enhanced Miller Algorithm Secure Against Counter Fault Attack vol.50, pp.7, 2013, https://doi.org/10.5573/ieek.2013.50.7.068