Fast modular reduction for large-integer multiplication for cryptosystem application

Suhas Sreehari, Huapeng Wu, Majid Ahmadi

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

3 Scopus citations

Abstract

In this paper, we attempt to speedup the modular reduction as an independent step of modular multiplication, which is the central operation in public-key cryptosystems. Based on the properties of Mersenne and Quasi-Mersenne primes, we have described four distinct sets of moduli which are responsible for converting the single-precision multiplication prevalent in many of today's techniques into an addition operation and a few simple shift operations. We propose a revision to the Modified Barrett algorithm presented in [3]. With the backing of the special moduli sets, our proposed algorithm is shown to outperform the Modified Barrett algorithm by nearly 25% when we consider the level of reduction (which bears a direct effect upon the speed of the second phase of reduction), and by over 10% when we consider the time taken for reduction.

Original languageEnglish
Title of host publication2012 2nd International Conference on Digital Information and Communication Technology and its Applications, DICTAP 2012
Pages226-229
Number of pages4
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 2nd International Conference on Digital Information and Communication Technology and its Applications, DICTAP 2012 - Bangkok, Thailand
Duration: May 16 2012May 18 2012

Publication series

Name2012 2nd International Conference on Digital Information and Communication Technology and its Applications, DICTAP 2012

Conference

Conference2012 2nd International Conference on Digital Information and Communication Technology and its Applications, DICTAP 2012
Country/TerritoryThailand
CityBangkok
Period05/16/1205/18/12

Keywords

  • Barrett-based reduction
  • Large integer modular reduction
  • Mersenne primes
  • Quasi-Mersenne primes

Fingerprint

Dive into the research topics of 'Fast modular reduction for large-integer multiplication for cryptosystem application'. Together they form a unique fingerprint.

Cite this