28 search results - page 5 / 6 » Constructing finite field extensions with large order elemen... |
IEICET
2008
13 years 5 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In interference alignment, users sharing a wireless channel are each able to achieve data rates of up to half of the non-interfering channel capacity, no matter the number of users...
TIT
2008
13 years 5 months ago
2008
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
IPMI
2003
Springer
14 years 6 months ago
2003
Springer
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...