기관회원 [로그인]
소속기관에서 받은 아이디, 비밀번호를 입력해 주세요.
개인회원 [로그인]

비회원 구매시 입력하신 핸드폰번호를 입력해 주세요.
본인 인증 후 구매내역을 확인하실 수 있습니다.

회원가입
서지반출
Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition
[STEP1]서지반출 형식 선택
파일형식
@
서지도구
SNS
기타
[STEP2]서지반출 정보 선택
  • 제목
  • URL
돌아가기
확인
취소
  • Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition
  • Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition
저자명
Eom. Soo Kyung,Lee. Eunjeong,Lee. Hyang-Sook
간행물명
ETRI journal
권/호정보
2013년|35권 5호|pp.880-888 (9 pages)
발행정보
한국전자통신연구원
파일정보
정기간행물|ENG|
PDF텍스트
주제분야
기타
이 논문은 한국과학기술정보연구원과 논문 연계를 통해 무료로 제공되는 원문입니다.
서지반출

기타언어초록

The preexisting pairings ate, $ate_i$, R-ate, and optimal-ate use q-expansion, where q is the size of the defining field for the elliptic curves. Elliptic curves with small embedding degrees only allow a few of these pairings. In such cases, efficiently computable endomorphisms can be used, as in [11] and [12]. They used the endomorphisms that have characteristic polynomials with very small coefficients, which led to some restrictions in finding various pairing-friendly curves. To construct more pairing-friendly curves, we consider ${mu}$-expansion using the Gallant-Lambert-Vanstone (GLV) decomposition method, where ${mu}$ is an arbitrary integer. We illustrate some pairing-friendly curves that provide more efficient pairing from the ${mu}$-expansion than from the ate pairing. The proposed method can achieve timing results at least 20% faster than the ate pairing.