28 search results - page 2 / 6 » Constructing finite field extensions with large order elemen... |
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
CAGD
2004
13 years 4 months ago
2004
In surface restoration usually a damaged region of a surface has to be replaced by a surface patch which restores the region in a suitable way. In particular one aims for C1-conti...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
AAECC
2002
Springer
13 years 4 months ago
2002
Springer
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
COMPUTING
2008
13 years 4 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...