Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A course in number theory and cryptography
A course in number theory and cryptography
Journal of Cryptology
Genus Two Hyperelliptic Curve Coprocessor
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Elliptic and hyperelliptic curves on embedded μP
ACM Transactions on Embedded Computing Systems (TECS)
IEEE Transactions on Computers
An algorithm for solving the discrete log problem on hyperelliptic curves
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.02 |
We investigate the jacobians of the hyperelliptic curves v2 + v = u2g+1 over finite fields, and discuss which are likely to have "almost prime" order.