From Euclid's GCD to Montgomery Multiplication to the Great Divide

By S. C. Shantz. 2001

91 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/afc4105f80613a3610fa6a6f2161d049062c9a5a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Darrel Hankerson
2. A. Wander
3. N. Gura
4. Scott A. Vanstone
5. Alfred J. Menezes
6. H. Eberle
7. Arun Patel
8. S. C. Shantz

Citations in the corpus

• Guide to Elliptic Curve Cryptography (2004, methodology): “Algorithms for field division were described by Goodman and Chandrakasan [177], Chang Shantz [90], Durand [126], and Schroeppel [412].”
• Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs (2004, methodology): “Inversion was implemented with the algorithm proposed by Chang Shantz [5].”