Faster elliptic curve point multiplication based on a novel greedy base-2,3 method

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2006, Pages 3374-3377

  Cohen, Aaron E ^a   Parhi, Keshab K ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELLIPTIC CURVE POINT MULTIPLICATION; ELLIPTIC CURVES; PRE-COMPUTATION TECHNIQUE;

APPLICATION SPECIFIC INTEGRATED CIRCUITS; BINARY SEQUENCES; COMPUTATIONAL METHODS; LOGIC CIRCUITS;

MULTIPLYING CIRCUITS;

EID: 34547311264     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. L. Rivest, A. Shamir, and L. Adleman, "A method for Obtaining Digital Signatures and Public-key Cryptosystem," Communications of ACM, vol. 21, no. 2, pp. 120-126, February 1978.
2. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Information Theory, vol. IT-22, no. 6, pp. 644-654, 1976. [Online]. Available: citeseer.ist.psu.edu/diffie76new.html
3. V. S. Miller, "Use of elliptic curves in cryptography," in Advances in Cryptology - CRYPTO '85: Proceedings, 1985, pp. 417-426.
4. N. Koblitz, "Elliptic Curve Cryptosystems," Mathematics of Computation, vol. 48, no. 177, pp. 203 209, January 1987.
5. J. Lopez and R. Dahab, "An overview of elliptic curve cryptography," Technical Report, 2000. [Online]. Available: citeseer.ist.psu.edu/lop00overview.html
6. P. Kocher, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems," in Proceedings of the 16th Annual International Cryptology Conference (CRYPTO), ser. Lecture Notes in Computer Science, vol. 1109, Santa Barbara, CA, Aug. 1996, pp. 104-113.
7. P. Kocher, J. Jaffe, and B. Jun, "Differential power analysis," Lecture Notes in Computer Science, vol. 1666, pp. 388-397, 1999. [Online]. Available: citeseer.ist.psu.edu/kocher99.differential.html
8. Acoustic Cryptanalysis. [Online]. Available: http://www.wisdom.weizmann. ac.il/~tromier/acoustic/
9. E. Brier and M. Joye, "Weierstraß Elliptic Curves and Side-Channel Attacks," in Public Key Cryptography: 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002, ser. Lecture Notes in Computer Science, vol. 2274, Paris, France, Feb. 2002, pp. 335-345.
10. P. L. Montgomery, "Speeding the Pollard and Elliptic Curve Methods of Factorization," Mathematics of Computation, vol. 48, no. 177, pp. 243-264, January 1987.
11. J. Guajardo and C. Paar, "Efficient Algorithms for Elliptic Curve Cryptosystems," The 17th Annual International Cryptology Conference, CRYPTO '97, pp. 342-356, 1997.
12. n)," in Selected Areas in Cryptography, 1998, pp. 201-212. [Online]. Available: citeseer.ist.psu.edu/ lopez98improved.html
13. M. Ciet, M. Joye, K. Lauter, and P. L. Montgomery, "Trading Inversions for Multiplications in Elliptic Curve Cryptography," 2003. [Online]. Available: eprint.iacr.org/2003/257/
14. K. Eisentrager, K. Lauter, and P. L. Montgomery, "An Efficient Procedure to Double and Add Points on an Elliptic Curve," 2002. [Online]. Available: research.microsoft.com/crypto/
15. R. Katti, "Speeding up Elliptic Cryptosystems using a new Signed Binary Representation for Integers," in Proceedings of the Euromicro Symposium on Digital System Design, 2002.
16. M. E. Kaihara and N. Takagi, "A hardware algorithm for modular multiplication/division," IEEE Transactions on Computers, vol. 54, no. 1, pp. 12-21, 2005.