Parallel Montgomery multiplication in GF(2k) using trinomial residue arithmetic

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2005, Pages 164-171

  Bajard, Jean Claude ^a   Imbert, Laurent ^a,b   Jullien, Graham A ^b  

^a LIRMM   (France)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL OPERATORS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

GENERAL MULTIPLICATION ALGORITHMS; PARALLEL MONTGOMERY MULTIPLICATION;

ALGORITHMS;

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

References (20)

1. k) for elliptic curve cryptography. In J.-C. Bajard and M. Schulte, editors, Proceedings 16th IEEE symposium on Computer Arithmetic, pages 181-187. IEEE Computer Society, 2003.
2. k). Designs, Codes and Cryptography, 14(1):57-69, April 1998.
3. Ç. K. Koç, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June 1996.
4. m) multiplication and division over dual basis. IEEE Transactions on Computers, 45(3):319-327, Mar. 1996.
5. k) using polynomial residue arithmetic. Designs, Codes and Cryptography, 20(2): 155-173, June 2000.
6. R. W. Hamming. Coding and information theory. Prentice-Hall, Englewood Cliffs, N.J., 1980.
7. D. Hankerson, A. Menezes, and S. Vanstone. Guide to Elliptic Curve Cryptography. Springer-Verlag, 2004.
8. M. A. Hasan, M. Z. Wang, and V. K. Bhargava. A modified Massey-Omura parallel multiplier for a class of finite field. IEEE Transactions on Computers, 42(10): 1278-1280, Oct. 1993.
9. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209, January 1987.
10. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, Cambridge, England, revised edition, 1994.
11. m), In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - AAECC-6, volume 357 of LNCS, pages 297-309. Springer-Verlag, 1989.
12. E. D. Mastrovito. VLSI Architectures for Computations in Galois Fields. PhD thesis, Linköping University, Linköping, Sweden, 1991.
13. A. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. CRC Press, 1997.
14. V. S. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume 218 of LNCS, pages 417-428. Springer-Verlag, 1986.
15. P.L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, Apr. 1985.
16. n). Discrete Applied Mathematics, 22(2): 149-161, 1988-1989.
17. F. Rodriguez-Henriquez and c. K. Koç. Parallel multipliers based on special irreducible pentanomials. IEEE Transactions on Computers, 52(12): 1535-1542, Dec. 2003.
18. k) multipliers. IEEE Transactions on Computers, 53(9): 1097-1105, Sept. 2004.
19. B. Sunar and Ç. K. Koç. Mastrovito multiplier for all trinomials. IEEE Transactions on Computers, 48(5):522-527, May 1999.
20. H. Wu, M. A. Hasan, and I. F. Blake. New low-complexity bit-parallel finite field multipliers using weakly dual bases. IEEE Transactions on Computers, 47(11): 1223-1234, Nov. 1998.