General modular multiplication by block multiplication and table lookup

Cheng Wen Wu, Yung Fa Chou

Research output: Contribution to journalConference article

5 Citations (Scopus)

Abstract

This paper deals with the problem of general modular multiplication, i.e., A × B mod M. To solve it in hardware, we suggest a simple lookup-table based approach and use the novel block multiplier which we have developed earlier on. The area (A) and time (T) complexities of this multiplier are both O(n log n) if carry-lookahead adders are used. Most previously proposed modular multipliers have put restriction on the ranges of the multiplicand A, the multiplier B, and the modulus M. Our modular multiplier is general, which releases the restriction on those operands.

Original languageEnglish
Pages (from-to)295-298
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume4
Publication statusPublished - 1994 Dec 1
EventProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
Duration: 1994 May 301994 Jun 2

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'General modular multiplication by block multiplication and table lookup'. Together they form a unique fingerprint.

  • Cite this