Re: [Newbie] Prime factorization question

From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 10/08/03 

Date: Wed, 08 Oct 2003 10:33:00 GMT

Bill Unruh wrote:

> tomstdenis@yahoo.com (Tom St Denis) writes:
>
> ]"Lorenzo Bolognini" <lorenzo@mysurname.net> wrote in message
> news:<Bkzgb.179955$hE5.6064550@news1.tin.it>... ]> "Bill Unruh"
> <unruh@string.physics.ubc.ca> ha scritto nel messaggio ]>
> news:bluef3$md2$1@string.physics.ubc.ca... ]>
> ]> > Yes, the primes are randomly selected from those with a certain
> length. ]>
> ]> So they are known and sure they are prooven and certificated primes
> ]> (otherwise the cipher would be vulnerable to other attacks than plain
> ]> bruteforcing) and they are finite so the number of possible primes that
> may ]> generate the cipher is very much restricted... well how many are
> they? Not ]> that I want to procastinate my thought that you said to be
> mistaken but I ]> just want to understand this stuff something more. (Ok
> so maybe starting ]> studying number theory would be fine u one could say!
> ;-)
>
> ]Amateurs....
>
> Yes, but you are an amaeur reader. What was being talked about was RSA,
> not Diffie Hellman. The OP was under the impression that RSA used a set
> of known, programmed in primes to create the product. It does not. Just
> as DH does not use a known exponent.

Yes, and commonly when people think of fixed primes it's DH not RSA.
Perhaps the dude was like totally like shinizle frizzled?

And I did read the OP posts. I just used some reasoning [shock! horror!]
and tried to figure out if he was just confused with DH.

Tom