2015•Unpublished venueOpen access

Interesting Results Arising from Karatsuba Multiplication - Montgomery family of formulae

Srinivasa Rao Subramanya Rao

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Multiplication (music), Arithmetic, Computer science, Parallel computing, Mathematics, Combinatorics