A fast modular-multiplication algorithm based on a higher radix
H Morita�- Advances in Cryptology—CRYPTO'89 Proceedings 9, 1990 - Springer
H Morita
Advances in Cryptology—CRYPTO'89 Proceedings 9, 1990•Springer… 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
2 4). … This section describes a new algorithm based on a radix higher than two, which can
reduce the amount of processing. … However, until now, no algorithm using a higher radix
to speed-up modular multiplication has been developed because of the problem of
overflowing a finite computation range. The new …
will multiply modulo N in log(N)/log(r) clock pulses when the algorithm is based on radix r (r
2 4). … This section describes a new algorithm based on a radix higher than two, which can
reduce the amount of processing. … However, until now, no algorithm using a higher radix
to speed-up modular multiplication has been developed because of the problem of
overflowing a finite computation range. The new …
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).
Springer
Showing the best result for this search. See all results