Breaking pairing-based cryptosystems using ηT pairing over GF(397)

@article{Hayashi2012BreakingPC,
  title={Breaking pairing-based cryptosystems using ηT pairing over GF(397)},
  author={Takuya Hayashi and Takeshi Shimoyama and Naoyuki Shinohara and Tsuyoshi Takagi},
  journal={IACR Cryptology ePrint Archive},
  year={2012},
  volume={2012},
  pages={345}
}
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… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

Pairing-Based Cryptography – Pairing 2013

Lecture Notes in Computer Science • 2013
View 9 Excerpts
Highly Influenced

A Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks

IEEE Communications Surveys & Tutorials • 2016
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 32 references

The Function Field Sieve in the Medium Prime Case

EUROCRYPT • 2006
View 19 Excerpts
Highly Influenced

Strategies in Filtering in the Number Field Sieve

ANTS • 2000
View 9 Excerpts
Highly Influenced

The function field sieve

ANTS • 1994
View 5 Excerpts
Highly Influenced

The Function Field Sieve Is Quite Special

View 4 Excerpts
Highly Influenced

Breaking pairing - based cryptosystems using η T pairing over GF ( 3 97 )

T. Hayashi, N. Shinohara, +3 authors T. Takagi
Cryptology ePrint Archive , Report • 2012

Solving a 676-bit discrete logarithm problem in GF (3),

T. Hayashi, N. Shinohara, +3 authors T. Takagi
PKC • 2010

Similar Papers

Loading similar papers…