未找到相关数据
The Weil Pairing, and Its Efficient Calculation
被引：0
作者：
Victor S. Miller
机构：
[1] Center for Communications Research,
[2] Princeton,undefined
[3] NJ 08540,undefined
来源：
Journal of Cryptology
|
2004年
/
17卷
关键词：
Elliptic curve;
Discrete logarithm;
Weil pairing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Weil Pairing, first introduced by André Weil in 1940, plays an
important role in the theoretical study of the arithmetic of
elliptic curves and Abelian varieties. It has also recently become
extremely useful in cryptologic constructions related to those
objects. This paper gives the definition of the Weil Pairing,
describes efficient algorithms to calculate it, gives two
applications, and describes the motivation to considering it.
引用
收藏
页码：235 / 261
页数：26
相关论文