Performance of finite field arithmetic in an elliptic curve cryptosystem

IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems - Proceedings

Volumn , Issue , 2001, Pages 249-256

  Li, Z ^a   Higgins, J ^a   Clement, M ^a  

^a BRIGHAM YOUNG UNIVERSITY   (United States)

Author keywords

ElGamel; Elliptic curve; Encryption; Normal basis; Polynomial basis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; NETWORK PROTOCOLS; POLYNOMIALS; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOGRAPHY (ECC);

CRYPTOGRAPHY;

EID: 0034822912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. New directions in cryptography
2. A Survey of fast exponentiation methods
3. Efficient algorithms for elliptic curve cryptosystems
4. Fast algorithms for elliptic curve cryptosystems over binary finite field
5. A fast algorithm for computing multiplication inverses in GF(2m) using normal bases
6. Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic
7. Elliptic curve cryptosystems
8. Modulus search for elliptic curve cryptosystems
9. Counting the number of points on elliptic curves over finite fields: Strategies and performance
10. Fast implementation of elliptic curve arithmetic in GF (pn)
11. Reducing elliptic curve logorithms to logorithms in a finite field
12. Use of elliptic curves in cryptography
13. n)
14. A method for obtaining digital signatures and public-key cryptosystems
15. A structural comparison of the computational difficulty of breaking discrete log cryptosystems
16. Fast key exchange with elliptic curve systems
17. Elliptic curve cryptosystems over small fields of odd characteristic
18. The discrete logarithm problem on elliptic curves of trace one
19. A fast software implementation for arithmetic operations in GF(2n)