On Wed, 27 Feb 2002, Lucky Green wrote:
Philip,
If we can at all fit it into the schedule, IFCA will attempt to offer a
colloquium on this topic at FC. Based on the countless calls inquiring about
this issue that I received just in the last few days, the customers of
financial cryptography are
Enzo Michelangeli [EMAIL PROTECTED] writes:
Well, a nice characteristic that RSA doesn't have is the ability of using as
secret key a hash of the passphrase, which avoids the need of a secret
keyring
All PK algorithms have this property; seed a CSPRNG with the
passphrase and use the CSPRNG as
Isn't Elliptic-Curve patent-encumbered?
I think we went through this a few weeks ago. Nope. Fortunately, ECC
per-se is not patent encumbered. Scott Vanstone makes much of that
in his ECC dog and pony show.
Of course, free ECC does not mean some nice optimizations aren't
patented.
On Tue, Feb 26, 2002 at 08:40:40AM -0800, bear wrote:
I'm not completely comfortable with Elliptic-Curve systems. The
mathematics is relatively young and has seen a lot of progress.
Right. I'm not very comfortable with Elliptic-Curve yet, either.
I haven't been able to work out exactly
Leitl' [EMAIL PROTECTED]; 'Cryptography
List' [EMAIL PROTECTED]
Sent: Monday, February 25, 2002 12:25 PM
Subject: RE: Cringely Gives KnowNow Some Unbelievable Free Press... (fwd)
-Original Message-
From: bear [mailto:[EMAIL PROTECTED]]
Sent: Monday, February 25, 2002 2:49 PM
On Thu
Being a numb skull in such things does it mean IPSEC VPN is not secure?
At present im running 1024bit the cpu hit is high, going to 2048 i
suspect / told its even higher
:(
regards,
Thing
bear wrote:
[Moderator's inquiry: Any third parties care to comment on this? --Perry]
On Thu, 21
At 11:49 AM -0800 2/25/02, bear wrote:
...
The secure forever level of difficulty that we used to believe
we got from 2kbit keys in RSA is apparently a property of 6kbit
keys and higher, barring further highly-unexpected discoveries.
Highly-unexpected? All of public key cryptography is build
[Moderator's inquiry: Any third parties care to comment on this? --Perry]
On Thu, 21 Feb 2002, Phillip H. Zakas wrote:
On Tue, 5 Feb 2002, Eugene Leitl wrote:
But at Crypto last August, Dan Bernstein announced a new design for a
machine dedicated to NFS using asymptotically fast algorithms
-- Eugen* Leitl a href=http://leitl.org;leitl/a
__
ICBMTO: N48 04'14.8'' E11 36'41.2'' http://www.leitl.org
57F9CFD3: ED90 0433 EB74 E4A9 537F CFF5 86E7 629B 57F9 CFD3
-- Forwarded message --
Date: Tue, 5 Feb 2002
-- Eugen* Leitl a href=http://leitl.org;leitl/a
__
ICBMTO: N48 04'14.8'' E11 36'41.2'' http://www.leitl.org
57F9CFD3: ED90 0433 EB74 E4A9 537F CFF5 86E7 629B 57F9 CFD3
-- Forwarded message --
Date: Tue, 5 Feb
Although the headers and quoting have gotten munged, this
appears to be a reply to my message.
Eugene Leitl [EMAIL PROTECTED] writes:
-- Eugen* Leitl a href=http://leitl.org;leitl/a
__
ICBMTO: N48 04'14.8'' E11 36'41.2''
At 2:25 AM -0800 2/5/02, Eugene Leitl wrote:
-- Eugen* Leitl a href=http://leitl.org;leitl/a
__
ICBMTO: N48 04'14.8'' E11 36'41.2'' http://www.leitl.org
57F9CFD3: ED90 0433 EB74 E4A9 537F CFF5 86E7 629B 57F9 CFD3
-- Forwarded
--
On 27 Jan 2002, at 21:17, Eugene Leitl wrote:
I think the only patents of particular note for ECC are
Certicom and H.P.'s ones on point-compression.
The original paper on ECC proposed point compression and
described the algorithm in 1985.
See Bernstein's web page
At 7:38 AM -0800 1/29/02, Eric Rescorla wrote:
Ben Laurie [EMAIL PROTECTED] writes:
Eric Rescorla wrote:
BTW, I don't see why using a passphrase to a key makes you vulnerable to
a dictionary attack (like, you really are going to have a dictionary of
all possible 1024 bit keys crossed with
Ben Laurie [EMAIL PROTECTED] writes:
Eric Rescorla wrote:
I don't know exactly what Pegwit does, but most of these schemes
are still vulnerable to dictionary attacks by trying arbitrary
passphrases and seeing if they generate the correct public key.
It's of course slower since the test
Eugene Leitl [EMAIL PROTECTED] writes:
-- Forwarded message --
Date: Sun, 27 Jan 2002 21:10:09 +0100 (CET)
From: Robert Harley [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Cringely Gives KnowNow Some Unbelievable Free Press...
Adam Beberg wrote:
I'm preaty sure
- Original Message -
From: Eric Rescorla [EMAIL PROTECTED]
To: Eugene Leitl [EMAIL PROTECTED]
Sent: Monday, 28 January, 2002 6:33 AM
[...]
If you want to see EC used you need to describe a specific algorithm
which has the following three properties:
(1) widely agreed to be
Enzo Michelangeli [EMAIL PROTECTED] writes:
- Original Message -
From: Eric Rescorla [EMAIL PROTECTED]
To: Eugene Leitl [EMAIL PROTECTED]
Sent: Monday, 28 January, 2002 6:33 AM
[...]
If you want to see EC used you need to describe a specific algorithm
which has the following
-- Eugen* Leitl a href=http://leitl.org;leitl/a
__
ICBMTO: N48 04'14.8'' E11 36'41.2'' http://www.leitl.org
57F9CFD3: ED90 0433 EB74 E4A9 537F CFF5 86E7 629B 57F9 CFD3
-- Forwarded message --
Date: Sun, 27 Jan 2002
19 matches
Mail list logo
