A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This contribution introduces a class of Galois eld used to achieve fast nite eld arithmetic which we call an Optimal Extension Field (OEF). This approach is well suited for implementation of publickey cryptosystems based on elliptic and hyperelliptic curves. Whereas previous reported optimizations focus on nite elds of the form GF(p) and GF(2 m ), an OEF is the class of elds GF(p m ), for p a prime of special form and m a positive integer. Modern RISC workstation processors are optimized todoi:10.1007/bfb0055748 fatcat:7fclfpqsyrej3jqy4h6excogdi