Re: [Newbie] Prime factorization question
From: Mxsmanic (mxsmanic_at_hotmail.com)
Date: 10/10/03
- Next message: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Previous message: Mxsmanic: "Re: [Newbie] Prime factorization question"
- In reply to: Roger Schlafly: "Re: [Newbie] Prime factorization question"
- Next in thread: Bryan Olson: "Re: [Newbie] Prime factorization question"
- Reply: Bryan Olson: "Re: [Newbie] Prime factorization question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 10 Oct 2003 04:33:02 +0200
Roger Schlafly writes:
> Very useful. Diffie-Hellman often uses non-random primes.
But RSA works best if the primes are random and of the same
length--right?
-- Transpose hotmail and mxsmanic in my e-mail address to reach me directly.
- Next message: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Previous message: Mxsmanic: "Re: [Newbie] Prime factorization question"
- In reply to: Roger Schlafly: "Re: [Newbie] Prime factorization question"
- Next in thread: Bryan Olson: "Re: [Newbie] Prime factorization question"
- Reply: Bryan Olson: "Re: [Newbie] Prime factorization question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Loading