A comparison of different finite fields for elliptic curve cryptosystems

Computers and Mathematics with Applications

Volumn 42, Issue 1-2, 2001, Pages 91-100

  Smart, N P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cryptography; Elliptic curves; Finite fields

Indexed keywords

FINITE ELEMENT METHOD; OPTIMIZATION; SET THEORY; STANDARDS;

FINITE FIELDS;

CRYPTOGRAPHY;

EID: 0035399524     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(01)00133-X     Document Type: Article

References (18)

1. Optimal extension fields for fast arithmetic in public-key algorithms
2. Elliptic curve cryptography on smart cards without coprocessors
3. On the performance of signature schemes based on elliptic curves
4. Modular multiplication without trial division
5. Analyzing and comparing montgomery multiplication algorithm
6. WTLS: Wireless Transport Layer Security Specification
7. Finite fields
8. Efficient arithmetic in finite field extensions with applications in elliptic curve cryptography
9. m) using normal bases
10. Differential power analysis