Modular multiplication using the core function in the residue number system

Yinan Kong, Shahzad Asif*, Mohammad A U Khan

*Corresponding author for this work

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Modular multiplication can be performed in the residue number system (RNS) using a type of Montgomery reduction. This paper presents an alternative in which RNS modular multiplication are performed by using the core function. All of the intermediate calculations use short wordlength operations within the RNS. This work contributes to the long wordlength modular multiplication operation Z = A×B mod M, the basis of many DSPs and public-key cryptosystems.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalApplicable Algebra in Engineering, Communications and Computing
Volume27
Issue number1
DOIs
Publication statusPublished - 1 Jan 2016

Keywords

  • Core function
  • Digital arithmetic
  • Modular multiplication
  • The residue number system

Fingerprint Dive into the research topics of 'Modular multiplication using the core function in the residue number system'. Together they form a unique fingerprint.

  • Cite this