Efficient multiplication in GF(pk) for elliptic curve cryptography

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2003, Pages 181-187

  Bajard, J C ^a   Imbert, L ^a   Negre C ^a   Plantard, T ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTER HARDWARE; CURVE FITTING; POLYNOMIALS; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOGRAPHY;

CRYPTOGRAPHY;

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

References (23)

1. D. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public-key algorithms. In H. Krawczyk, editor, Advances in Cryptography - CRYPTO'98, volume 1462 of Lecture Notes in Computer Science (LNCS), pages 472-485. Springer-Verlag, 1998.
2. D. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3): 153-176, 2001.
3. D. Boneh, H. Shacham, and B. Lynn. Short signatures from the Weil pairing. In proceedings of Asiacrypt'01, volume 2139 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2001.
4. k). Designs, Codes and Cryptography, 14(1):57-69, April 1998.
5. R. Crandall. Method and apparatus for public key exchange in a cryptographic system. U.S. Patent number 5159632, 1992.
6. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
7. k) using polynomial residue arithmetic. Designs, Codes and Cryptography, 20(2): 155-173, June 2000.
8. A. Joux. A one round protocol for tripartite Diffie-Hellman. In 4th International Algorithmic Number Theory Symposium (ANTS-IV, volume 1838 of Lecture Notes in Computer Science, pages 385-393. Springer-Verlag, July 2000.
9. G. A. Jullien, W. Luo, and N. Wigley. High Throughput VLSI DSP Using Replicated Finite Rings. Journal of VLSI Signal Processing, 14(2):207-220, November 1996.
10. D. E. Knuth. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, MA, third edition, 1997.
11. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209, January 1987.
12. N. Koblitz. A Course in Number Theory and Cryptography, volume 114 of Graduate texts in mathematics. Springer-Verlag, second edition, 1994.
13. N. Koblitz. Algebraic aspects of cryptography, volume 3 of Algorithms and computation in mathematics. Springer-Verlag, 1998.
14. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1997.
15. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, April 1985.
16. 4n). IEEE Transactions on Computers, 47(2): 162-170, February 1998.
17. N - 1. IEEE Transactions on Computers, 41(8):957-961, August 1992.
18. N. P. Smart. A comparison of different finite fields for use in elliptic curve cryptosystems. Research report CSTR-00007, University of Bristol, June 2000.
19. N. Takagi and S. Yajima. Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem. IEEE Transactions on Computers, 41(7):887-891, July 1992.
20. F. J. Taylor. Large moduli multipliers for signal processing. IEEE Transactions on Circuits and Systems, C-28:731-736, Jul 1981.
21. J. Von Zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
22. Z. Wang, G. A. Jullien, and W. C. Miller. An Efficient Tree Architecture for Modulo 2n + 1 Multiplication. Journal of VLSI Signal Processing, 14(3):241-248, December 1996.
23. T. Yanik, E. Savaş, and Ç. K. Koç. Incomplete reduction in modular arithmetic. IEE Proceedings: Computers and Digital Technique, 149(2):46-52, March 2002.