Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications

David Naccache, David M'raïhi, Dan Raphaeli

Research output: Contribution to journalArticlepeer-review

Abstract

Montgomery's algorithm [8], hereafter denoted Mn(...,...), is a process for computing Mn (A, B)=ABN mod n where N is a constant factor depending only on n. Usually, A B mod n is obtained by Mn (Mn (A, B), N-2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(...,...) will replace directly each modular multiplication. Except the advantage of halving the number of Montgomery multiplications, our strategy skips the precalculation (and the storage) of the constant N-2 mod n and turns to be particularly efficient when a hardware device implementing Mn(...,...) is the basic computational tool at one's command.

Original languageEnglish
Pages (from-to)73-80
Number of pages8
JournalDesigns, Codes, and Cryptography
Volume5
Issue number1
DOIs
StatePublished - Jan 1995
Externally publishedYes

Fingerprint

Dive into the research topics of 'Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications'. Together they form a unique fingerprint.

Cite this