65 search results - page 6 / 13 » Trading Inversions for Multiplications in Elliptic Curve Cry... |
ISDA
2006
IEEE
14 years 1 months ago
2006
IEEE
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...
PKC
2004
Springer
14 years 25 days ago
2004
Springer
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
ICISC
2004
13 years 9 months ago
2004
Abstract. This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and ...
WAIFI
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...