Author:
Hankerson Darrel,Menezes Alfred
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Adleman L, DeMarrais J, Huang M (1994) A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Algorithmic number theory—ANTS-I. Lecture notes in computer science, vol 877. Springer, Berlin/New York, pp 28–40
2. Barbulescu R, Gaudry P, Joux A, Thomé E (2014) A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic: improvements over FFS in small to medium characteristic. Advances in cryptology—EUROCRYPT 2014. Lecture notes in computer science, vol 8441. Springer, Berlin/New York, pp 1–16
3. Diem C (2011a) On the discrete logarithm problem in class groups of curves. Math Comput 80:443–475
4. Diem C (2011b) On the discrete logarithm problem in elliptic curves. Compos Math 147:75–104
5. Frey G (2001) Applications of arithmetical geometry to cryptographic constructions. In: Proceedings of the Fifth International Conference on Finite Fields and Applications. Springer, Berlin, pp 128–161