47 search results - page 9 / 10 » Novel Precomputation Schemes for Elliptic Curve Cryptosystem... |
CRYPTO
2004
Springer
14 years 26 days ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
PKC
2010
Springer
13 years 9 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...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
WISEC
2009
ACM
14 years 2 months ago
2009
ACM
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach t...