Comparison of three modular reduction functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 773 LNCS, Issue , 1994, Pages 175-186

  Bosselaers, Antoon ^a   Govaerts, René ^a   Vandewalle, Joos ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MODULAR EXPONENTIATION; MODULAR REDUCTION; MONTGOMERY; PORTABLE SOFTWARE; PUBLIC KEY CRYPTOSYSTEMS; S-ALGORITHMS; TIME-CRITICAL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 85015231653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_16     Document Type: Conference Paper

References (10)

1. P.D. Barrett, “Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor,” Advanced in Cryptology, Proc. Crypto’86, LNCS 263, A.M. Odlyzko, Ed., Springer-Verlag, 1987, pp. 311-323.
2. S.R. Dussé and B.S. Kaliski, “A cryptographic library for the Motorola DSP56000,” Advances in Cryptology, Proc. Eurocrypt’90, LNCS 473, I.B. Damgård, Ed., Springer-Verlag, 1991, pp. 230-244.
3. K. Hensel, Theorie der algebraischen Zahlen, Leipzig, 1908.
4. “American National Standard for Programming Languages-C,” ISO/IEC Standard 9899:1990, International Standards Organization, Geneva, 1990.
5. D.E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 2nd Edition, Addison-Wesley, Reading, Mass., 1981.
6. P.L. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, Vol. 44, 1985, pp. 519-521.
7. J.-J. Quisquater, presentation at the rump session of Eurocrypt’90.
8. M.O. Rabin, “Probabilistic algorithms for testing primality,” J. of Number Theory, Vol. 12, 1980, pp. 128-128.
9. M. Shand and J. Vuillemin, “Fast Implementations of RSA cryptography,” Proceedings of the 11th IEEE Symposium on Computer Arithmetic, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 252-259.
10. C.D. Walter, “Faster modular multiplication by operand scaling,” Advances in Cryptology, Proc. Crypto’91, LNCS 576, J. Feigenbaum, Ed., Springer-Verlag, 1992, pp. 313-323.