The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Speeding up the Arithmetic on Koblitz Curves of Genus Two
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
An Improved Method of Multiplication on Certain Elliptic Curves
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
PGP in constrained wireless devices
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Implementing a feasible attack against ECC2K-130 certicom challenge (abstract only)
ACM Communications in Computer Algebra
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Speeding Up the Pollard Rho Method on Prime Fields
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
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
A result on the distribution of quadratic residues with applications to elliptic curve cryptography
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Compact hardware for computing the tate pairing over 128-bit-security supersingular curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
On the correct use of the negation map in the Pollard rho method
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
International Journal of Applied Cryptography
Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Computing elliptic curve discrete logarithms with the negation map
Information Sciences: an International Journal
International Journal of Applied Cryptography
Improved Pollard rho method for computing discrete logarithms over finite extension fields
Journal of Computational and Applied Mathematics
Solving a discrete logarithm problem with auxiliary input on a 160-bit elliptic curve
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
On the strength comparison of the ECDLP and the IFP
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Speeding up elliptic curve discrete logarithm computations with point halving
Designs, Codes and Cryptography
| Hi-index | 0.01 |