Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
verfasst von : Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, Tsuyoshi Takagi
Erschienen in: Advances in Cryptology – ASIACRYPT 2012
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we discuss solving the DLP over
GF
(3
6·97
) by using the function field sieve (FFS) for breaking paring-based cryptosystems using the
η
T
pairing over
GF
(3
97
). The extension degree 97 has been intensively used in benchmarking tests for the implementation of the
η
T
pairing, and the order (923-bit) of
GF
(3
6·97
) is substantially larger than the previous world record (676-bit) of solving the DLP by using the FFS. We implemented the FFS for the medium prime case, and proposed several improvements of the FFS. Finally, we succeeded in solving the DLP over
GF
(3
6·97
). The entire computational time requires about 148.2 days using 252 CPU cores.