✦ LIBER ✦

Fast Algorithms for Implementation of Montgomery's Modular Multiplication Technique

✍ Scribed by P.V. Ananda Mohan

Publisher: Springer
Year: 2004
Tongue: English
Weight: 345 KB
Volume: 23
Category: Article
ISSN: 0278-081X
DOI: 10.1007/s00034-004-0820-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalisation of Brickell's algorithm

A generalisation of Brickell's algorithm for fast modular multiplication

✍ J. K. Gibson 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 440 KB

On the implementation of Strassen's fast

On the implementation of Strassen's fast multiplication algorithm

✍ Jacques Cohen; Martin Roth 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 739 KB

Stability of fast algorithms for matrix

Stability of fast algorithms for matrix multiplication

✍ Dario Bini; Grazia Lotti 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 362 KB

Fast algorithms for implementation of th

Fast algorithms for implementation of the Green’s function

✍ A. D. Yunakovsky 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 277 KB

A fast technique for Monte Carlo simulat

A fast technique for Monte Carlo simulation of the process of gas multiplication in cylindrical proportional counters

✍ A. Alkaa; K. Mitev; P. Ségur 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A fast implementation of explicit time-s

A fast implementation of explicit time-stepping algorithms with the finite element method for a class of nonlinear evolution problems

✍ A. Segal; N. Praagman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 759 KB

In this paper a class of nonlinear evolution problems is considered. It is shown that, under special conditions, the application of the product approximation method for nonlinear problems in the finite element method results in constant (ie. time-independent) matrices. In those cases the amount of c