A generalisation of Brickell's algorithm for fast modular multiplication (Q1115183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalisation of Brickell's algorithm for fast modular multiplication |
scientific article; zbMATH DE number 4085016
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalisation of Brickell's algorithm for fast modular multiplication |
scientific article; zbMATH DE number 4085016 |
Statements
A generalisation of Brickell's algorithm for fast modular multiplication (English)
0 references
1988
0 references
Brickell's algorithm [\textit{E. F. Brickell}, Advances in cryptology, Proc. Workshop, Santa Barbara/Calif. 1982, 51-60 (1983; Zbl 0519.68058)] finds \(A\times B\) mod C for n-bit integers A, B, C, using O(n) hardware to achieve an O(n) running time. This paper gives a generalization of his algorithm, and presents a proof, missing from Brickell's paper, that it works, showing the existence of other similar schemes.
0 references
computer arithmetic
0 references
cryptography
0 references
modular multiplication
0 references
computational number theory
0 references
0.92542624
0 references
0 references
0.9125395
0 references
0 references
0 references
0 references
0.8974019
0 references
