TY - GEN
T1 - Interesting results arising from Karatsuba multiplication - Montgomery family of formulae
AU - Rao, Srinivasa Rao Subramanya
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/9/25
Y1 - 2015/9/25
N2 - Multiplication is a frequently encountered operation in the implementation of cryptography. This paper shows that Montgomery's family of 3-way (degree 2 polynomial) multiplication algorithms can be obtained from the well known Karatsuba's multiplication algorithm. This paper also gives new families of formulae for 3-way (degree 2 polynomial) multiplication and extends a special case to multiply three numbers.
AB - Multiplication is a frequently encountered operation in the implementation of cryptography. This paper shows that Montgomery's family of 3-way (degree 2 polynomial) multiplication algorithms can be obtained from the well known Karatsuba's multiplication algorithm. This paper also gives new families of formulae for 3-way (degree 2 polynomial) multiplication and extends a special case to multiply three numbers.
KW - Efficient multiplication
KW - Karatsuba algorithm
KW - Montgomery's formulae
KW - Polynomial multiplication
KW - School-book multiplication
UR - http://www.scopus.com/inward/record.url?scp=84962514048&partnerID=8YFLogxK
U2 - 10.1145/2818567.2818666
DO - 10.1145/2818567.2818666
M3 - Conference contribution
T3 - ACM International Conference Proceeding Series
SP - 317
EP - 322
BT - 6th International Conference on Computer and Communication Technology, ICCCT 2015
PB - Association for Computing Machinery
T2 - 6th International Conference on Computer and Communication Technology, ICCCT 2015
Y2 - 25 September 2015 through 27 September 2015
ER -