Re: Question on safe prime
From: clem (clem_at_numeral.com)
Date: 04/26/03
- Next message: Tom St Denis: "Re: NKS 2003: Conference & Minicourse Reminder"
- Previous message: UpiNok: "If you call Finland, be aware that the government of Finland listens you ... publicly they have told that 200 phones are tapped every day ..."
- In reply to: jsavard_at_ecn.ab.ca: "Re: Question on safe prime"
- Next in thread: Michael Amling: "Re: Question on safe prime"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 26 Apr 2003 02:53:17 -0700
On Fri, 25 Apr 2003 15:17:41 GMT, jsavard@ecn.ab.ca () wrote:
>clem (clem@numeral.com) wrote:
>: On Fri, 25 Apr 2003 02:43:31 -0400, "Douglas A. Gwyn"
>: <DAGwyn@null.net> wrote:
>: >Tom St Denis wrote:
>
>: >> Well first off. Do you know what a "safe" prime is?
>
>: >We ought to standardize them so that everybody uses
>: >the same primes, known to be safe. Think how much
>: >work that will save!
>
>: It's a good idea, but I'm afraid Ritter got a patent on that back in
>: 2001, so you're on thin ice here. It is part of his soon-to-be
>: released package that allows PK-like key generation to be used with
>: dynamic substitution. But does it at workloads that are far below
>: what is used by conventional so-called prudent cryptosystems. The
>: extremely low workload is one of the main selling points. Sorry to
>: take the wind out of your sails, but I guess someone had to.
>
>I'm surprised that it was possible for Terry Ritter to patent using a
>standard prime, say a well-known Sophie Germain prime (ok, actually 2
>times a well-known Sophie Germain prime plus one) for Diffie-Hellman.
>
>As far as everybody using the same primes, known to be safe, for RSA, that
>of course would be a joke, as that would save work for the cryptanalyst.
>
>Now, maybe you mean that Terry Ritter got a patent on doing
>*Blum-Blum-Shub* with known safe primes. That would also lose the
>unpredictability of the sequence, since like RSA it depends on a modulus
>hard to factor, but the output could still be useful in some ways. Of
>course, doing Blum-Blum-Shub with large moduli doesn't exactly have a low
>workload... but using small numbers for a quadratic congruential generator
>that is highly nonlinear, a scaled-down BBS, along with Dynamic
>Substitution... I could see how Terry might patent something along those
>lines, and it _would_ be a good idea.
>
>That this patent would cover DH with a standard modulus, however, is
>unlikely.
>
>John Savard
you're killing me...
- Next message: Tom St Denis: "Re: NKS 2003: Conference & Minicourse Reminder"
- Previous message: UpiNok: "If you call Finland, be aware that the government of Finland listens you ... publicly they have told that 200 phones are tapped every day ..."
- In reply to: jsavard_at_ecn.ab.ca: "Re: Question on safe prime"
- Next in thread: Michael Amling: "Re: Question on safe prime"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|