From: Scottauge@aol.com
To: cypherpunks@toad.com
Message Hash: 2e82c43c49c9f3af4aa5e22cd0e62d73d394f47026e2cd120e41e134d186e506
Message ID: <960829223938397314410@emout12.mail.aol.com>
Reply To: _N/A
UTC Datetime: 1996-08-30 07:21:19 UTC
Raw Date: Fri, 30 Aug 1996 15:21:19 +0800
From: Scottauge@aol.com
Date: Fri, 30 Aug 1996 15:21:19 +0800
To: cypherpunks@toad.com
Subject: Exploring (RSA (001)
Message-ID: <960829223938_397314410@emout12.mail.aol.com>
MIME-Version: 1.0
Content-Type: text/plain
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.
Return to August 1996
Return to “Scottauge@aol.com”