搜索结果: 1-4 共查到“密码学 Final Exponentiation”相关记录4条 . 查询时间(0.052 秒)
Inverting the Final exponentiation of Tate pairings on ordinary elliptic curves using faults
Tate pairing Ate pairing final exponentiation
2016/1/4
The calculation of the Tate pairing on ordinary curves involves two major steps: the Miller Loop (ML) followed by the Final Exponentiation (FE). The first step for achieving a full pairing inversion w...
On the final exponentiation for calculating pairings on ordinary elliptic curves
Tate pairing addition chains
2009/6/10
When using pairing-friendly ordinary elliptic curves to com-
pute the Tate and related pairings, the computation consists of two main
components, the Miller loop and the so-called final exponentiati...
Some Efficient Algorithms for the Final Exponentiation of ´T Pairing
Tate pairing ´ T pairing final exponentiation
2009/1/4
Recently Tate pairing and its variations are attracted in
cryptography. Their operations consist of a main iteration loop and a
final exponentiation. The final exponentiation is necessary for gener...
A Coprocessor for the Final Exponentiation of the $\eta_T$ Pairing in Characteristic Three
characteristic three final exponentiation hardware accelerator FPGA
2008/9/16
Since the introduction of pairings over (hyper)elliptic curves
in constructive cryptographic applications, an ever increasing number
of protocols based on pairings have appeared in the literature....