|
Volumn 2779, Issue , 2003, Pages 203-213
|
Efficient modular reduction algorithm in TFq[x] and its application to "left to right" modular multiplication in IF2[x]
|
Author keywords
Barrett; Cryptography; ECDSA; Elliptic curves; Modular multiplication; Montgomery; Multiply and add without carries; Quotient evaluation; Smart card
|
Indexed keywords
ALGORITHMS;
EMBEDDED SYSTEMS;
GEOMETRY;
HARDWARE;
MEMORY ARCHITECTURE;
PUBLIC KEY CRYPTOGRAPHY;
RECONFIGURABLE HARDWARE;
SMART CARDS;
TRANSPORTATION;
BARRETT;
ECDSA;
ELLIPTIC CURVE;
MODULAR MULTIPLICATION;
MONTGOMERY;
MULTIPLICATIONS IN F2[X];
MULTIPLY AND ADD WITHOUT CARRIES;
QUOTIENT EVALUATION;
CRYPTOGRAPHY;
|
EID: 35048852025
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-45238-6_17 Document Type: Article |
Times cited : (8)
|
References (9)
|