190 search results - page 28 / 38 » Supersingular Elliptic Curves in Cryptography |
104
click to vote
TC
2010
14 years 6 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
104
click to vote
CHES
2005
Springer
15 years 5 months ago
2005
Springer
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The non-repudiation as an essential requirement of many applications can be provided by the asymmetric key model. With the evolution of new applications such as mobile commerce, it...
100
click to vote
PKC
2004
Springer
15 years 5 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
105
click to vote
ISSS
2002
IEEE
15 years 4 months ago
2002
IEEE
With the popularity of wireless communication devices a new important dimension of embedded systems design has arisen, that of security. This paper presents for the first time des...