Paper 2012/345
Breaking pairing-based cryptosystems using pairing over
Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, and Tsuyoshi Takagi
Abstract
There are many useful cryptographic schemes, such as ID-based encryption,
short signature, keyword searchable encryption, attribute-based encryption,
functional encryption, that use a bilinear pairing.
It is important to estimate the security of such pairing-based cryptosystems in cryptography.
The most essential number-theoretic problem in pairing-based cryptosystems is
the discrete logarithm problem (DLP)
because pairing-based cryptosystems are no longer secure once the underlining DLP is broken.
One efficient bilinear pairing is the
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- pairing-based cryptosystems
pairingdiscrete logarithm problemsfunction filed sieve - Contact author(s)
- t-hayashi @ math kyushu-u ac jp
- History
- 2012-06-22: received
- Short URL
- https://ia.cr/2012/345
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/345, author = {Takuya Hayashi and Takeshi Shimoyama and Naoyuki Shinohara and Tsuyoshi Takagi}, title = {Breaking pairing-based cryptosystems using $\e{ta_T}$ pairing over ${GF}(3^{97})$}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/345}, year = {2012}, url = {https://eprint.iacr.org/2012/345} }