Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Brickell (1982)
A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography
P. Montgomery (1985)
Modular multiplication without trial divisionMathematics of Computation, 44
R. Rivest, A. Shamir, L. Adleman (1978)
A method for obtaining digital signatures and public-key cryptosystemsCommun. ACM, 26
C. Wallace (1964)
A Suggestion for a Fast MultiplierIEEE Trans. Electron. Comput., 13
(1983)
G a m a l T
Brickell E. F. (1982)
A fast modular multiplication algorithm with applications in two-key cryptography, Advances in CryptologyProceedings of Crypto, 82
P. Zimmermann (1987)
Multiplication rapide en Le_Lisp
G. Blakley (1983)
A COMPUTER ALGORITHM FOR THE PRODUCT AB MODULOM, 32
Charles Wang, T. Truong, H. Shao, L. Deutsch, J. Omura, I. Reed (1983)
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, C-34
H. Kung (1973)
The computational complexity of algebraic numbersProceedings of the fifth annual ACM symposium on Theory of computing
D. Guinier (1989)
Parallel exponentiators using data signal processor chips and transputers for a flexible and efficient software implementation of public-key cryptosystems to run on PC's or larger systemsACM Sigsac Review, 6
191'1) : Schnelle Multiplikation grosser Zahlen
(1986)
Algorithmes pour I'anthmetique des tr~s grands entiers (Algorithms for ery large integer arithmetic)
S. Winograd (1967)
On the Time Required to Perform MultiplicationJ. ACM, 14
T. Beth (1985)
On the Arithmetics of Galoisfields and The Like. Algebraic Questions Arising in the Design of Secure Communication Systems
R. Brent (1976)
Fast Multiple-Precision Evaluation of Elementary FunctionsJ. ACM, 23
(1981)
The Art of Programming Semi-Numerical Algorithms
(1986)
M o n e t S
D. Denning (1982)
Cryptography and Data Security
Karatsuba A. (1962)
Multiplication on multidigit numbers on automataDolk Akad Nauk SSSR, 145
A. Borodin, I. Munro (1975)
The computational complexity of algebraic and numeric problems, 1
W. Diffie, M. Hellman (1976)
New Directions in CryptographyDemocratizing Cryptography
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
Collins G. E. (1982)
Arithmetic in basic algebraic domains, ComputingSuppl., 4
Gamal T. (1983)
A subexponential-time algorithm for computing discrete logarithms over GF(p2), Advances in CryptologyProceedings of Crypto, 83
D. Guinier (1988)
D.S.P.P.: a data security pipe protocol for PC's,large scale systems or networksACM Sigsac Review, 6
T. Elgamal (1985)
A subexponential-time algorithm for computing discrete logarithms over GF(p^2)IEEE Transactions on Information Theory, 31
M. Fischer, L. Stockmeyer (1973)
Fast on-line integer multiplicationProceedings of the fifth annual ACM symposium on Theory of computing
G. Brassard, S. Monet, D. Zuffellato (1986)
Algorithms for very large integer arithmeticTechnique Et Science Informatiques, 5
G. Orton, M. Roy, P. Scott, L. Peppard, S. Tavares (1986)
VLSI Implementation of Public-Key Encryption Algorithms
J. Duprat, J. Muller (1988)
Hardwired Polynomial EvaluationJ. Parallel Distributed Comput., 5
A. Karatsuba, Yu. Ofman (1963)
Multiplication of Multidigit Numbers on AutomataSoviet physics. Doklady, 7
(1981)
Occam 2, language definition
G. Collins, M. Mignotte, F. Winkler (1983)
Arithmetic in Basic Algebraic Domains
Taher Gamal (1985)
A subexponential-time algorithm for computing discrete logarithms over GF(p2)IEEE Trans. Inf. Theory, 31
S. Nakamura, Kai-Yu Chu (1988)
A Single Chip Parallel Multiplier by MOS TechnologyIEEE Trans. Computers, 37
D. Knuth (1968)
The Art of Computer Programming
Beth T. (1985)
On the arithmetics of Galoisfields and the like, Advances in CryptologyProceedings of Eurocrypt, 85
Orton G. A. (1986)
VLSI implementation of public-key encryption algorithms. Advances in CryptologyProceedings of Crypto, 86
Som Maire (2020)
ProtectionEncyclopedia of the UN Sustainable Development Goals
Computing the long multiplication in fixed-radix representation is described first which suggests the use of two mixed solutions: first the sequentialisation of Karatsuba's algorithm by its extension to hexa and octo-mul then their judicious combination plus Implementation in Occam 2 language. Computing the long multiplication in modular representation . Including the principles of modular arithmetic and the Chinese remainder theorem, with efficient methods, is given in detail, together with their implementation for transformation from integer fixed-radix to modular and back again . Choice for modulil are made to compute the Inverse modulo efficiently without a need for the Euclid's algorithm. Montgomery's method for "Computing the long multiplication without trial division" for avoiding time consuming integer-modular-integer conversions at each multiplication-square step is described. It is possible to apply such a method to the exponentiation process currently used in Cryptography because It is interesting to use it only in the case where several multiplications are done in modulo N. Cryptographic applications for computing asymmetric keys may use the present implementations to advantage.
ACM SIGSAC Review – Association for Computing Machinery
Published: Jan 1, 1990
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.