Author:
Kwon Jihoon,Seo Seog Chung,Hong Seokhie
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems,Theoretical Computer Science,Software
Reference31 articles.
1. Adj G, Menezes A, Oliveira T, Rodríguez-Henríquez F (2013) Weakness of
$${\mathbb{F}}_{3^{6 \cdot 509}}$$
F
3
6
·
509
for discrete logarithm cryptography. In: International Conference on Pairing-Based Cryptography. Springer, New York, pp 20–44
2. Adj G, Menezes A, Oliveira T, Rodriguez-Henriquez F (2015) Weakness of
$${\mathbb{F}}_{3^{6 \cdot 1429}}$$
F
3
6
·
1429
and
$${\mathbb{F}}_{2^{4 \cdot 3041}}$$
F
2
4
·
3041
for discrete logarithm cryptography. Finite Fields Appl 32:148–170
3. Barbulescu R, Gaudry P, Joux A, Thomé E (2014) A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp 1–16
4. Barreto PS, Galbraith SD, hÉigeartaigh CÓ, Scott M (2007) Efficient pairing computation on supersingular abelian varieties. Des Codes Cryptogr 42(3):239–271
5. Barreto PS, Kim HY, Lynn B, Scott M (2002) Efficient algorithms for pairing-based cryptosystems. In: Annual International Cryptology Conference. Springer, New York, pp 354–369
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献