Signed sliding window algorithms for modulo multiplication

Electronics Letters

Volumn 36, Issue 23, 2000, Pages 1925-1927

  Phillips, B J ^a   Burgess, N ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; COMPUTATION THEORY; TABLE LOOKUP;

SIGNED SLIDING WINDOW ALGORITHMS;

ALGORITHMS;

EID: 0034319511     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20001360     Document Type: Article

References (6)

1. KOČ, C.K., and HUNG, C.Y.: 'Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers', Comput. Math. Appl., 1992, 24, (3), pp. 3-12
2. HUI, L.C.K., and LAM, K.-Y.: 'Fast square-and-multiply exponentiation for RSA', Electron. Lett., 1994, 30, (17), pp. 1396-1397
3. LAM, K.-Y., and HUI, L.C.K.: 'Efficiency of SS(l) square-and-multiply exponentiation algorithms', Electron. Lett., 1994, 30, (25), pp. 2115-2116
4. YACOBI, Y.: 'Exponentiating faster with addition chains'. EUROCRYPT '90, Aarhus, Denmark, 21-24 May 1990, pp. 222-229 (published as Lecture Notes in Comput. Sci., 473, Springer-Verlag, Berlin, 1991)
5. YACOBI, Y.: 'Exponentiating faster with addition chains'. EUROCRYPT '90, Aarhus, Denmark, 21-24 May 1990, pp. 222-229 (published as Lecture Notes in Comput. Sci., 473, Springer-Verlag, Berlin, 1991)
6. MONTGOMERY, P.L.: 'Modular multiplication without trial division', Math. Comput., 1985, 44, (170), pp. 519-521