Highly parallel modular multiplication in the residue number system using sum of residues reduction

Braden J. Phillips; Yinan Kong; Zhining Lim

doi:10.1007/s00200-010-0124-2

Highly parallel modular multiplication in the residue number system using sum of residues reduction

Braden J. Phillips, Yinan Kong, Zhining Lim

Research output: Contribution to journal › Article › peer-review

15 Citations (Scopus)

Abstract

A new algorithm for modular multiplication in the residue number system (RNS) is presented. Modular reduction is performed using a sum of residues. As all of the residues can be evaluated simultaneously, the algorithm permits a highly parallel implementation and is suitable for performing public-key cryptography operations with very low latency.

Original language	English
Pages (from-to)	249-255
Number of pages	7
Journal	Applicable Algebra in Engineering, Communications and Computing
Volume	21
Issue number	3
DOIs	https://doi.org/10.1007/s00200-010-0124-2
Publication status	Published - 2010
Externally published	Yes

Keywords

Modular multiplication
Public-key cryptography
Residue number systems
RNS

Access to Document

10.1007/s00200-010-0124-2

Cite this

@article{fa53f7badc164cafb42209b93985f061,

title = "Highly parallel modular multiplication in the residue number system using sum of residues reduction",

abstract = "A new algorithm for modular multiplication in the residue number system (RNS) is presented. Modular reduction is performed using a sum of residues. As all of the residues can be evaluated simultaneously, the algorithm permits a highly parallel implementation and is suitable for performing public-key cryptography operations with very low latency.",

keywords = "Modular multiplication, Public-key cryptography, Residue number systems, RNS",

author = "Phillips, {Braden J.} and Yinan Kong and Zhining Lim",

year = "2010",

doi = "10.1007/s00200-010-0124-2",

language = "English",

volume = "21",

pages = "249--255",

journal = "Applicable Algebra in Engineering, Communications and Computing",

issn = "0938-1279",

publisher = "Springer, Springer Nature",

number = "3",

}

TY - JOUR

T1 - Highly parallel modular multiplication in the residue number system using sum of residues reduction

AU - Phillips, Braden J.

AU - Kong, Yinan

AU - Lim, Zhining

PY - 2010

Y1 - 2010

N2 - A new algorithm for modular multiplication in the residue number system (RNS) is presented. Modular reduction is performed using a sum of residues. As all of the residues can be evaluated simultaneously, the algorithm permits a highly parallel implementation and is suitable for performing public-key cryptography operations with very low latency.

AB - A new algorithm for modular multiplication in the residue number system (RNS) is presented. Modular reduction is performed using a sum of residues. As all of the residues can be evaluated simultaneously, the algorithm permits a highly parallel implementation and is suitable for performing public-key cryptography operations with very low latency.

KW - Modular multiplication

KW - Public-key cryptography

KW - Residue number systems

KW - RNS

UR - http://www.scopus.com/inward/record.url?scp=77952008950&partnerID=8YFLogxK

U2 - 10.1007/s00200-010-0124-2

DO - 10.1007/s00200-010-0124-2

M3 - Article

AN - SCOPUS:77952008950

SN - 0938-1279

VL - 21

SP - 249

EP - 255

JO - Applicable Algebra in Engineering, Communications and Computing

JF - Applicable Algebra in Engineering, Communications and Computing

IS - 3

ER -

Highly parallel modular multiplication in the residue number system using sum of residues reduction

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this