A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods
IEEE Transactions on Computers
Speeding up scalar multiplication using a new signed binary representation for integers
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
| Hi-index | 0.00 |
Two new signed binary representations are presented that simplify hardware or software necessary in elliptic curve crytosystems. Simplified algorithms are presented for computing the new binary representations. This speeds up elliptic cryptosystems. The algorithms are useful for smart card applications and digital signature verification applications. The first algorithm computes a new representation for an integer d and speeds up the computation of d 脳 P, where P is a point on an elliptic curve. The second algorithm computes a new representation for two integers g and h and speeds up the computation of (g 脳 P) + (h 脳 Q), where P and Q are points on an elliptic curve.