28 search results - page 1 / 6 » Constructing finite field extensions with large order elemen... |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
WAIFI
2010
Springer
14 years 12 days ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The aim of this paper is to deal with multi-physics simulation of micro-electro-mechanical systems (MEMS) based on an advanced numerical methodology. MEMS are very small devices i...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...