🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.crypt
Article #1039

Re: pgp2.0 - what is an appropriate key length?

#1039
From: Keith Lewis
Date: Mon, 28 Sep 1992 20:26
44 lines
2708 bytes
In article <1992Sep25.191759.25545@nevada.edu>, oliverm@nevada.edu (Moises Oliveira ) writes:
>I keep hearing that RSA uses the product of two big primes to produce a really
>big number that is hard to factor.  Appearently the diffuculty in factoring
>the product of two primes is what makes RSA so hard to crack.

Yes.

>Now, assume that the actual factoring is trivial by use of some mathematical
>method.  What good does it do you?  Exactly how does having the two prime 
>factors of some really big number do to help you crack RSA?
>
>In other words, if see someones public key, how can I find what really
>big number they used? And then after I factor it, what whould I do to the
>encrypted communications to return it to plain text?

You have two large primes, P and Q.
Let N = P * Q.  That's your "really big number".
Find a pair of numbers, E and D, such that mod(E * D, (P-1)*(Q-1)) = 1
You publish N and E as your public key.  To encrypt messages, calculate
    Y = mod(X ** E, N), where X is the input data

You keep N and D as your private key.  To decrypt messages, calculate
    X = mod(Y ** D, N), where Y is the encrypted data

If you have somebody's N and E, and you somehow factor N into P and Q, you
must then find a D that works in the above equality (a non-trivial task, I
think).  Then you can decrypt his/her messages.

>Finally, is the product of two primes method used in all public keys, or
>just in RSA? what about PGP?  What about the one the NSA and NIST produced.?

PGP is essentially RSA performed on a bitmask which is used repeatedly on
a single message.  I don't know about the others.

>If anyone has any books or other materials that they would reccommend for
>reading on the security of this type, I would appreciate it.

Check out the "Mathematical Games" column of _Scientific American_, August
1977, for a cursory examination of RSA.  Then August 1978 for a full-blown
article.

Keith Lewis             klewis@mitre.org          "Mr. Cheap"
I don't dance to music; music dances to me.  Email me for my PGP key.
The above may not (yet) represent the opinions of my employer.
Technical Details
Message-ID: <1992Sep28.202620.25342@linus.mitre.org>
Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!olivea!charnel!rat!usc!sol.ctr.columbia.edu!caen!sdd.hp.com!think.com!linus!linus.mitre.org!news
References: <1992Sep25.191759.25545@nevada.edu>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!olivea!charnel!rat!usc!sol.ctr.columbia.edu!caen!sdd.hp.com!think.com!linus!linus.mitre.org!news
From: lewis@aera8700.mitre.org (Keith Lewis)
Newsgroups: sci.crypt,alt.security,alt.security.pgp
Subject: Re: pgp2.0 - what is an appropriate key length?
Message-ID: <1992Sep28.202620.25342@linus.mitre.org>
Date: 28 Sep 92 20:26:20 GMT
References: <1992Sep25.191759.25545@nevada.edu>
Sender: news@linus.mitre.org (News Service)
Organization: The MITRE Corporation
Lines: 44
Nntp-Posting-Host: aera8700.mitre.org