[3280] in cryptography@c2.net mail archive
Questions
daemon@ATHENA.MIT.EDU (Walied.Othman@Student.KULeuven.ac.)
Mon Sep 14 12:32:35 1998
From: Walied.Othman@Student.KULeuven.ac.be
To: Cryptography@c2.net
Date: Mon, 14 Sep 1998 18:22:46
I 'm designing a package to handle large (signed) integers (in pascal), the size of these
integers are merely bounded by the available memory. First a trivial question: Does
anyone have a fast (faster than euclidean division) algorithm to calculate x mod n?
Performance:
What number of cycles are acceptable/fast/extraordinary to multiply/add x-digit
numbers?
What functions (besides the basics (+,-,*,/), and x mod n, x^d mod n) should such a a
package contain?
If I 'm forgetting something, let me know.
Walied Othman
