76 search results - page 11 / 16 » Pipelining GF(P) Elliptic Curve Cryptography Computation |
ARITH
2007
IEEE
15 years 4 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
CORR
2010
Springer
14 years 10 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...
101
Voted
IJSNET
2008
14 years 10 months ago
2008
: Public key cryptography (PKC) has been considered for a long time to be computationally too expensive for small battery powered devices. However, PKC turned out to be very benefi...
ISCAS
2006
IEEE
15 years 4 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
IJNSEC
2008
14 years 10 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...