Author of the publication

Modular Multiplication without Trial Division

. Mathematics of Computation, 44 (170): 519--521 (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Analysis of Affine Coordinates for Pairing Computation., , and . Pairing, volume 6487 of Lecture Notes in Computer Science, page 1-20. Springer, (2010)A Block Lanczos Algorithm for Finding Dependencies Over GF(2).. EUROCRYPT, volume 921 of Lecture Notes in Computer Science, page 106-120. Springer, (1995)A World Wide Number Field Sieve Factoring Record: On to 512 Bits., , , , , and . ASIACRYPT, volume 1163 of Lecture Notes in Computer Science, page 382-394. Springer, (1996)Efficient SIMD Arithmetic Modulo a Mersenne Number., , , and . IEEE Symposium on Computer Arithmetic, page 213-221. IEEE Computer Society, (2011)Division by Invariant Integers using Multiplication., and . PLDI, page 61-72. ACM, (1994)Evaluation of boolean expressions on one's complement machines.. ACM SIGPLAN Notices, 13 (12): 60-72 (1978)Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves., , and . ANTS, volume 3076 of Lecture Notes in Computer Science, page 169-183. Springer, (2004)Modular Multiplication without Trial Division. Mathematics of Computation, 44 (170): 519--521 (1985)Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation., , and . CT-RSA, volume 2612 of Lecture Notes in Computer Science, page 343-354. Springer, (2003)Improved Stage 2 to P±1 Factoring Algorithms., and . ANTS, volume 5011 of Lecture Notes in Computer Science, page 180-195. Springer, (2008)