Re: [Newbie] Prime factorization question
From: Gregory G Rose (ggr_at_qualcomm.com)
Date: 10/08/03
- Next message: Mxsmanic: "Re: Are natural languages secure ciphers?"
- Previous message: Tom St Denis: "SSL Addition to LibTomCrypt"
- In reply to: Bill Unruh: "Re: [Newbie] Prime factorization question"
- Next in thread: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Reply: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 8 Oct 2003 04:27:24 -0700
In article <bm0p0b$4dq$1@string.physics.ubc.ca>,
Bill Unruh <unruh@string.physics.ubc.ca> wrote:
>]The primality of the selected random numbers is not conclusively
>]verified, but it is tested with an algorithm that provides a very high
>
>While true, it now could be. There is a recent algorithm which can prove
>conclusively that a number is prime or not.
>PGP could now use that. It would make no difference.
Actually, the recent algorithm just runs in
deterministic time. There were already faster
algorithms that proved primality.
Greg.
-- Greg Rose 232B EC8F 44C6 C853 D68F E107 E6BF CD2F 1081 A37C Crypto Mini-FAQ: http://www.schlafly.net/crypto/faq.txt Qualcomm Australia: http://www.qualcomm.com.au
- Next message: Mxsmanic: "Re: Are natural languages secure ciphers?"
- Previous message: Tom St Denis: "SSL Addition to LibTomCrypt"
- In reply to: Bill Unruh: "Re: [Newbie] Prime factorization question"
- Next in thread: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Reply: Mxsmanic: "Re: [Newbie] Prime factorization question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
