![]() |
Volumn 49, Issue 7, 2000, Pages 749-758
|
Look-up table-based large finite field multiplication in memory constrained cryptosystems
|
Author keywords
Computer arithmetic; Cryptographic systems; Galois (or finite) field multiplication; Polynomial basis and look up tables
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
COMPUTER HARDWARE;
CRYPTOGRAPHY;
DIGITAL ARITHMETIC;
ITERATIVE METHODS;
PROBABILITY;
SMART CARDS;
TABLE LOOKUP;
COMPUTER ARITHMETIC;
GALOIS FIELD MULTIPLICATION;
LOOK UP BASED ALGORITHMS;
POLYNOMIAL BASIS;
ALGORITHMS;
|
EID: 0034216098
PISSN: 00189340
EISSN: None
Source Type: Journal
DOI: 10.1109/12.863045 Document Type: Article |
Times cited : (45)
|
References (13)
|