𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An iterative modular multiplication algorithm

✍ Scribed by P.C. Leong; E.C. Tan; P.C. Tan

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
392 KB
Volume
44
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

iterative modular multiplication algorithm designed for efficient implementation on a processor with limited capacity such as an 8-bit microcontroller is proposed, It is a generalization of Chiou and Yang's algorithm and can be implemented in software without excessive bit shifting. A proof of correctness of the proposed algorithm is given together with a run-time analysis. (~) 2002 Elsevier Science Ltd. All rights reserved.

πŸ“œ SIMILAR VOLUMES

An accelerated multiplicative iterative
An accelerated multiplicative iterative algorithm in image reconstruction
✍ Li Liu; Yuan-mei Wang πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 349 KB

## Abstract Based on the ML‐EM (maximum likelihood expectation maximization) algorithm and AWLS (one kind of multiplicative weighted least square) reconstruction, a new algorithm named RMITC (rapid multiplicative iteration with total‐count conservation) is proposed. The new method assumes a higher

A QR algorithm with variable iteration m
A QR algorithm with variable iteration multiplicity
✍ Augustin A. Dubrulle πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 694 KB

I reconsider some hypotheses concerning errant behaviors of the m-tuple QR iteration for real Hessenberg matrices, including potential effects of small products of codiagonal elements on bulge and shift vectors, and the fimess of Householder matrices as information carriers. The design of an iterati

An efficient algorithm for parallel inte
An efficient algorithm for parallel integer multiplication
✍ Benjamin Singer; George Saon πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t