학술저널
Comparing the MOV Reduction and FR Reduction
Comparing the MOV Reduction and FR Reduction
- 동의대학교 정보통신연구소
- 정보통신연구지
- 제3-2집
-
2002.12171 - 177 (7 pages)
- 0
커버이미지 없음
This paper introduce the discrete logarithm problem(DLP) in elliptic curve cryptography. In particular, we compare the MOV reduction and FR reduction.
Abstract
1.Introduction
2.Weil pairing
3.Tate pairing
4.Comparing the MOV and FR reduction for computation
5.Conclusions
References
(0)
(0)