@inproceedings{b3021fe275c3474c8bdf7c2af2c2dbe1,
title = "Interesting results arising from Karatsuba multiplication - Montgomery family of formulae",
abstract = "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.",
keywords = "Efficient multiplication, Karatsuba algorithm, Montgomery's formulae, Polynomial multiplication, School-book multiplication",
author = "Rao, \{Srinivasa Rao Subramanya\}",
note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 6th International Conference on Computer and Communication Technology, ICCCT 2015 ; Conference date: 25-09-2015 Through 27-09-2015",
year = "2015",
month = sep,
day = "25",
doi = "10.1145/2818567.2818666",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery (ACM)",
pages = "317--322",
booktitle = "6th International Conference on Computer and Communication Technology, ICCCT 2015",
address = "United States",
}