A new side channel resistant scalar point multiplication method for binary elliptic curves

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2006, Pages 1205-1209

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

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELLIPTIC CURVES (EC); MONTGOMERY; PRE COMPUTATION; RUN TIME; SCALAR POINT MULTIPLICATION; SIDE CHANNEL ATTACK (SCA); SIDE CHANNELS;

EID: 47049093833     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2006.354946     Document Type: Conference Paper

References (17)

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. The OpenSSL Toolkit for SSL. [Online]. Available: www.openssl.org
4. The Crypto++ Library. [Online]. Available: www.cryptopp.com
5. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000.
6. IEEE Standard Specifications for Public-Key Cryptography, IEEE Std 1363-2000.
7. J. Lopez and R. Dahab, "An overview of elliptic curve cryptography," Technical Report, 2000. [Online]. Available: citeseer.ist.psu.edu/lop00overview.html
8. K. Okeya, K. Schmidt-Samoa, C. Spahn, and T. Takagi, "Signed Binary Representations Revisited," in Proceedings of the 24th Annual International Cryptology Conference (CRYPTO), ser. Lecture Notes in Computer Science, vol. 3152, Santa Barbara, CA, Aug. 2004, pp. 123-139.
9. A. E. Cohen and K. K. Parhi, "Faster Elliptic Curve Point Multiplication Based on a Novel Greedy Base-2,3 Method," in Proceedings of International Symposium on Circuits and Systems (ISCAS) to appear, Island of Kos, Greece, May 2006.
10. 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.
11. 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/kocher99differential.html
12. A. Shamir and E. Tromer, "Acoustic Cryptanalysis: On nosy people and noisy machines." [Online]. Available: http://www.wisdom.weizmann. ac.il/~tromer/acoustic/
13. A. K. Daneshbeh and M. A. Hasan, "Area efficient high speed elliptic curve cryptoprocessor for random curves," in Proceedings of International Conference on Information Technology: Coding and Computing, vol. 2, Las Vegas, NV, Apr. 2004, pp. 588-592.
14. m) without Pre computation," in Workshop on Cryptographic Hardware and Embedded Systems (CHES) LNCS, vol. 1717, 1999, pp. 316-327. [Online]. Available: citeseer.ist.psu.edu/lopez98improved.html
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, Sept. 2002, pp. 380-384.
16. P. L. Montgomery, "Speeding the Pollard and Elliptic Curve Methods of Factorization," Mathematics of Computation, vol. 48, no. 177, pp. 243-264, 1987. [Online]. Available: http://links.jstor.org/sici?sici=0025- 5718%28198701%2948%3A177%3C243%3ASTPAEC%3E2.0.CO%3B2-3
17. K. Okeya and K. Sakurai, "Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve," in Proceedings of Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science, vol. 2162, Paris, France, May 2001, pp. 129-144.