1400 search results - page 4 / 280 » On multiplication in finite fields |
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
ACISP
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
ASAP
2004
IEEE
13 years 11 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...
MOC
2000
13 years 7 months ago
2000
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...