Exponentiating faster with addition chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 473 LNCS, Issue , 1991, Pages 222-229

  Yacobi, Y ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY;

ADDITION CHAINS; CRYPTOGRAPHIC SYSTEMS; DATA COMPRESSION ALGORITHMS; DIFFIE HELLMAN; EXPONENTIATIONS; FAST COMPUTATION; RUNTIMES; SHORT CODES;

COMPUTATIONAL EFFICIENCY;

EID: 85043760127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46877-3_20     Document Type: Conference Paper

References (9)

1. J. Bos, M. Coster: “Addition Chain Heuristics”, Crypto’89.
2. H. Cohen, and A.K. Lenstra: “Implementation of a New Pnmality Test”, Math. of Computation, Vol. 48, No. 177, Jan. 1987, pp.103-121.
3. Downey, Leony, and Sethi: “Computing Sequences With Addition Chains”, SIAM Jour, Comput. 3, (1981), pp.638-696.
4. P. Erdös: “Remarks on Number Theory III, on Addition Chains”, Acta Arith. VI (1960), pp.77-81.
5. Graham, Knuth and Patashnik: “Concrete Mathematics, a Foundation for Computer Science”, Addison Wesley, 1988.
6. Lempel and Ziv: “Compression of Individual Sequences via Variable Rate Coding” IEEE Trans of Inf. Theory, IT-24 No. 5 (September 1978) pp.530-536.
7. Knuth: “The Art of Computer Programming, Vol. 2, Seminumerical Algorithms”, Addison-Wesley, 1980, pp.441-462.
8. J.J. Quisquater: (A talk on m-ary exponentiation at the Rump session of Eurocrypt’90)
9. Schönhage: “A Lower Bound on The Length of Addition Chains”, Theoretical Computer Science Vol. 1 (1975), pp.229-242.