Interesting results arising from Karatsuba multiplication - Montgomery family of formulae

Srinivasa Rao Subramanya Rao*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publication6th International Conference on Computer and Communication Technology, ICCCT 2015
    PublisherAssociation for Computing Machinery
    Pages317-322
    Number of pages6
    ISBN (Electronic)9781450335522
    DOIs
    Publication statusPublished - 25 Sept 2015
    Event6th International Conference on Computer and Communication Technology, ICCCT 2015 - Allahabad, India
    Duration: 25 Sept 201527 Sept 2015

    Publication series

    NameACM International Conference Proceeding Series
    Volume25-27-September-2015

    Conference

    Conference6th International Conference on Computer and Communication Technology, ICCCT 2015
    Country/TerritoryIndia
    CityAllahabad
    Period25/09/1527/09/15

    Fingerprint

    Dive into the research topics of 'Interesting results arising from Karatsuba multiplication - Montgomery family of formulae'. Together they form a unique fingerprint.

    Cite this