A fast modular-multiplication algorithm based on a higher radix

Authors:
Hikaru Morita
Affiliations:
-
Venue:
CRYPTO '89 Proceedings on Advances in cryptology
Year:
1989

Citing 4
Cited 5

Fast RSA-hardware: dream or reality

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Computer Arithmetic: Principles, Architecture and Design

Computer Arithmetic: Principles, Architecture and Design
A Computer Algorithm for Calculating the Product AB Modulo M

IEEE Transactions on Computers

A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation

IEEE Transactions on Computers - Special issue on computer arithmetic
Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem

IEEE Transactions on Computers
Low power scalable encryption for wireless systems

Wireless Networks - Special issue VLSI in wireless networks
VLSI Implementation of Modulo Multiplication Using Carry Free Addition

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Hardware architectures for public key cryptography

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new fast compact modular-multiplication algorithm, which will multiply modulo N in log(N)/log(r) clock pulses when the algorithm is based on radix r (r 驴 4).