34 search results - page 2 / 7 » Performance of Finite Field Arithmetic in an Elliptic Curve ... |
PKC
2000
Springer
13 years 8 months ago
2000
Springer
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over...
WAIFI
2010
Springer
13 years 10 months 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...
ARC
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides...
PKC
1998
Springer
13 years 8 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
IJNSEC
2010
12 years 11 months ago
2010
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...