For access to this article, please select a purchase option:
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Your recommendation has been sent to your librarian.
A new method for fast exponentiation is introduced by adapting the work of Gallant, Lambert and Vanstone to finite fields: thus, it is applicable to the multiplicative subgroups of non-prime fields with efficient group homomorphisms such as pth powering maps. When applied to a quartic extension of a 256 bit prime field, the proposed method runs up to 60% faster than ordinary exponentiation in a 1024 bit prime field. (This report is a sequel to a previous report by the authors.)
Inspec keywords: Galois fields; public key cryptography; group theory
Other keywords:
Subjects: Cryptography theory; Information theory; Information theory; Cryptography