Seminário de Teoria da Computação FFT-Suitable Extension Fields for Elliptic Curve Arithmetic Alberto Alexandre Miranda Sexta-feira, 10 de outubro de 2003 (notem a mudança de sala) ===> Sala 85,IC-2, 13:00hs In this article, we suggest a class of Galois fields of prime power order (GF(p^n)) for use in elliptic curve cryptography. Most of the previously suggested field multiplication optimizations are based on variations of classical multiplication, and sometimes the Karatsuba method is used. Our optimizations are based on a well known multiplication technique, the Fast Fourier Transform. Some sample timing results showing the performance improvements are also presented. The optimizations contained herein are suitable for both workstations and constrained environments, since very little extra space is required. www.ic.unicamp.br/~fkm/seminarios