Re: BN functions and Solaris 7 'bc' disagree

[Richard Levitte - VMS Whacker]

From: cFischer <[EMAIL PROTECTED]>

ino-waiting> On Mon-01.05.00-09:55, Ted Powell wrote:
ino-waiting> > Whatever the limits of the Solaris bc are, I would expect to get 
something
ino-waiting> > like the following (actual Solaris output) when they are reached:
ino-waiting> >     $ bc
ino-waiting> >     10^10000
ino-waiting> 
ino-waiting> what is all this math-tender for in the first place?
ino-waiting> are these calculations that a public-key cryptosystem has
ino-waiting> to be capable of?

Oh yes, definitely.  I assume you've heard of RSA, and that it uses
pretty big primes to make the key pair from?  Here are the formulas
used with no further explanation (using two big primes, p and q, and
a smaller e.  m is the message):

        n = p*q

        d = e^-1 mod e

        c = m^e mod n

        m = c^d mod n

The last formula should hint on how capable exponentiation has to be,
for example.

-- 
Richard Levitte   \ Spannvägen 38, II \ [EMAIL PROTECTED]
Chairman@Stacken   \ S-168 35  BROMMA  \ T: +46-8-26 52 47
Redakteur@Stacken   \      SWEDEN       \ or +46-708-26 53 44
Procurator Odiosus Ex Infernis             -- [EMAIL PROTECTED]
           Member of the OpenSSL development team

Unsolicited commercial email is subject to an archival fee of $400.
See <http://www.stacken.kth.se/~levitte/mail/> for more info.
______________________________________________________________________
OpenSSL Project                                 http://www.openssl.org
User Support Mailing List                    [EMAIL PROTECTED]
Automated List Manager                           [EMAIL PROTECTED]