论文信息 - Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih - 字舞流文

Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih

Yen and Laih (1993) proposed an algorithm for efficient computation of the common-multiplicand multiplications problem. >

Tzong-Chen Wu | Tzong-Chen Wu | Yuh-Shihng Chang | Yuh-Shihng Chang

[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[4] J. Wrench. Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[5] Sung-Ming Yen,et al. Common-multiplicand multiplication and its applications to public key cryptography , 1993 .