搜索结果: 1-1 共查到“密码学 Ordinary Curves”相关记录1条 . 查询时间(0.073 秒)
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Efficient software implementation explicit formulas bilinear pairings
2010/10/20
We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considered only for arithmetic in quadra...