A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

Tác giả: Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica

Nguồn trích: Progress in cryptology-INDOCRYPT 2001-LNCS 22418.7

Năm xuất bản: 1905

Số trang: 116

Tóm tắt: In 1999 Silverman [21] introduced a family of binary finite fields which are composite extensions of F and on which arithmetic operations can be performed more quickly than on prime extensions of F 2 2 of the same size. We present here a fast approach to elliptic curve cryptography using a distinguished subset of the set of Silverman fields F 2 N = F . This approach leads to a theoretical computation speedup over fields of the same size, using a standard point of view (cf. [7]). We also analys

Từ khóa: Finite fields,Weil descent

Tải về