Comparison of three modular reduction functions
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 175-186
- https://doi.org/10.1007/3-540-48329-2_16
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fast implementations of RSA cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Faster Modular Multiplication by Operand ScalingPublished by Springer Nature ,2001
- A Cryptographic Library for the Motorola DSP56000Lecture Notes in Computer Science, 1991
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980