A course in computational algebraic number theory
A course in computational algebraic number theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
| Hi-index | 0.00 |
Combining the ideas of Bauer, Teske and Weng, [1] and Gaudry, Schost [3], we give a low memory algorithm for computing the number of points on the Jacobian of a Picard curve. It is efficient enough to handle Picard curves over finite prime fields${\mathbb F}_{p}$, where p is a prime with 58 bits. We present an example where the Jacobian has a prime group order of size 2174