home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.crypt:5781 alt.security.pgp:231
- Path: sparky!uunet!spool.mu.edu!agate!dog.ee.lbl.gov!news!nosc!crash!nadir!crespin
- From: crespin@nadir.uucp (Rudy Crespin)
- Newsgroups: sci.crypt,alt.security.pgp
- Subject: Re: RSA Question (was Re: PKP/RSA comments on PGP legality)
- Message-ID: <r09LrAXKBh107h@nadir.uucp>
- Date: Wed, 16 Dec 92 17:51:39 -0800
- References: <dOsLrAnGBh107h@nadir.uucp> <1992Dec14.190615.13954@macc.wisc.edu> <PHR.92Dec16022546@napa.telebit.com>
- Organization: UUCP San Diego, CA
- Lines: 29
-
- In <PHR.92Dec16022546@napa.telebit.com> phr@telebit.com (Paul Rubin) writes:
- > Please excuse my ignorance, but, how can "your wife" decode the message
- > knowing 34, 91, 7, and 13?
-
- > i.e. I have a number
- > (X^3) moulo 77 (product of two primes) = 48
- > what is my number? and how did you get the answer?
-
- [Stuff Deleted]
-
- >In the case of N=77 and N=91, phi(N) is a multiple of 3 so no
- >suitable t exists. You have to have picked your original primes
- >p and q to make this not happen.
-
- O.K., now that you've excused my ignorance, I beg you excuse my stupidity.
-
- Same number X^3(mod, 391) = 133
- (phi(N) is not divisible by 3) What is my number?
-
- I tried to figure out t, but got stumped.
- Thanks again,
- Rudy Crespin
-
- --
- _ _
- --- O | Rudy Crespin | / \ |\ | __ / \ |\ |
- -- <^- | crespin@nadir.uucp | \_/ | \| \_/ | \|
- -- -\/\ | crash!nadir!crespin |
- --- \ | |- No-No, it is On-On.
-