Paper 2012/042
Key Length Estimation of Pairing-based Cryptosystems using Pairing
Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi, and Tsuyoshi Takagi
Abstract
The security of pairing-based cryptosystems depends on the difficulty of the discrete logarithm problem (DLP) over certain types of finite fields. One of the most efficient algorithms for computing a pairing is the
Note: Table 1 and 3 are edited.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. This is a full version of ISPEC 2012 paper.
- Keywords
- pairing-based cryptosystemsdiscrete logarithm problemfinite fieldkey lengthsuitable values
- Contact author(s)
- shnhr @ nict go jp
- History
- 2012-06-19: revised
- 2012-01-29: received
- See all versions
- Short URL
- https://ia.cr/2012/042
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/042, author = {Naoyuki Shinohara and Takeshi Shimoyama and Takuya Hayashi and Tsuyoshi Takagi}, title = {Key Length Estimation of Pairing-based Cryptosystems using $\e{ta_T}$ Pairing}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/042}, year = {2012}, url = {https://eprint.iacr.org/2012/042} }