Exploring (RSA (001)
Scottauge at aol.com
Scottauge at aol.com
Fri Aug 30 00:21:19 PDT 1996
Exploring Rivest, Shamir, Adelman algorithm, but hoping someone out there is
interested in very large number manipulations.
RSA suggests choosing two prime 100 digit numbers p and q for beginning of
key generation.
These numbers are obviously beyond the long type of a C program.
Other than using Mathematica or Maple, I would like to use C or perferrably
C++.
Just some basics such as multiplication, addition, subtraction, division,
mod, etc over the Z set.
More information about the cypherpunks-legacy
mailing list