80 search results - page 12 / 16 » Efficient Multivariate Factorization over Finite Fields |
107
click to vote
PKC
1998
Springer
15 years 3 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...
118
click to vote
PKC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
123
click to vote
CRYPTO
1991
Springer
15 years 3 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Considerable advances have been made in learning to recognize and localize visual object classes. Simple bag-offeature approaches label each pixel or patch independently. More adv...