본문 바로가기 주메뉴 바로가기
검색 검색영역닫기 검색 검색영역닫기 ENGLISH 메뉴 전체보기 메뉴 전체보기

논문

Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm

https://doi.org/10.4218/etrij.11.0210.0338|

  • 저자Cheol-Min Park ; Hyang­Sook Lee
  • 학술지ETRI Journal 33
  • 등재유형
  • 게재일자(2011)


In ICISC 2007, Comuta and others showed that among the methods for constructing pairing­friendly curves, those using cyclotomic polynomials, that is, the Brezing­Weng method and the Freeman­Scott­Teske method, are affected by Cheon's algorithm. This paper proposes a method for searching parameters of pairing­friendly elliptic curves that induces minimal security loss by Cheon's algorithm. We also provide a sample set of parameters of BN­curves, FST­curves, and KSS­curves for pairing­based cryptography.


In ICISC 2007, Comuta and others showed that among the methods for constructing pairing­friendly curves, those using cyclotomic polynomials, that is, the Brezing­Weng method and the Freeman­Scott­Teske method, are affected by Cheon's algorithm. This paper proposes a method for searching parameters of pairing­friendly elliptic curves that induces minimal security loss by Cheon's algorithm. We also provide a sample set of parameters of BN­curves, FST­curves, and KSS­curves for pairing­based cryptography.

이 페이지에서 제공하는 정보에 대해 만족하십니까?