1993-10-04 - German writer seeks simple RSA numerical example (fwd)

Header Data

From: “L. Detweiler” <ld231782@longs.lance.colostate.edu>
To: cypherpunks@toad.com
Message Hash: 5db709f188d9527fc4e096215add3b9380c0320801a30095aea365e159408132
Message ID: <9310042357.AA01088@longs.lance.colostate.edu>
Reply To: N/A
UTC Datetime: 1993-10-04 23:59:08 UTC
Raw Date: Mon, 4 Oct 93 16:59:08 PDT

Raw message

From: "L. Detweiler" <ld231782@longs.lance.colostate.edu>
Date: Mon, 4 Oct 93 16:59:08 PDT
To: cypherpunks@toad.com
Subject: German writer seeks simple RSA numerical example (fwd)
Message-ID: <9310042357.AA01088@longs.lance.colostate.edu>
MIME-Version: 1.0
Content-Type: text/plain

actually, something like this should be in a FAQ. but please help him out.


Date: Mon, 4 Oct 93 02:10:36 CET
From: simons@peti.GUN.de (Peter Simons)
Subject: RSA exmaples required

I'm authoring an article for a german computer magazine about PGP and
the RSA public key scheme and I'd like to include an exmaple for my
mathematical explaination. The problem is, that both factors have to
be quite large to get nice examples.

        p = 5    q = 7

        xy = 4*6+1 = 25         x=5

You see, with smaller factors, x and y are equal or 1 and xy. But a
larger set of factors would require a serious amount of calculations.

So, does somebody have a nice example for the RSA algorithm ready??

        bye, Peter

- ----- Peter Simons, Germany

                     Bye's First Law of Model Railroading:
        Anytime you wish to demonstrate something, the number of faults
                   is proportional to the number of viewers.