I was away at a couple of trade shows and forgot to send a there will
be some delays message before I left. The moderation backlog should
start clearing later today.
--
Perry E. Metzger[EMAIL PROTECTED]
--
NetBSD: The right OS for your embedded design.
At 08:52 AM 04/24/2002 +0800, Enzo Michelangeli wrote:
In particular, none of the naysayers explained me clearly why it should be
reasonable to use 256-bit ciphers like AES with 1024-bit PK keypairs. Even
before Bernstein's papers it was widely accepted that bruteforcing a 256-bit
cipher requires
http://online.wsj.com/article_print/0,4287,SB1019779375174781800,00.html
April 26, 2002
NEW MEDIA
Pact Is Reached to Stop Pirating
Of Digital TV Over the Internet
By YOCHI J. DREAZEN and STEPHANIE STEITZER
Staff Reporters of THE WALL STREET JOURNAL
WASHINGTON -- Representatives from the
http://www.nytimes.com/reuters/technology/tech-tech-mcafee-networkassociates.html?dlbk=pagewanted=printposition=top
April 25, 2002
Network Associates Drops McAfee Bid, Stocks Hit
By REUTERS
Filed at 7:49 p.m. ET
NEW YORK (Reuters) - Computer security provider Network Associates Inc.
Folks on this list might be interested in a National Research Council
report on nationwide identity systems: http://books.nap.edu/html/id_questions/
--Steve Bellovin, http://www.research.att.com/~smb
Full text of Firewalls book now at http://www.wilyhacker.com
At 05:52 PM 4/23/2002 Tuesday, Enzo Michelangeli wrote:
[...] And if the reason for the 256 bits is the possible deployment,
sometimes in the future, of quantum computers, well in that case we should
stop using PK cryptography altogether.
Hi Enzo!
Disclaimer: I am not a quantum mechanic, and I
Sorry, there's a mistake in my post, which makes the relationship finding
phase look easier than it actually is. BTW, why did it take 5 days for
that post to go through?
On Wed, Apr 24, 2002 at 12:30:26PM -0700, Wei Dai wrote:
Using a factor base size of 10^9, in the relationship finding phase
--- begin forwarded text
Status: U
To: [EMAIL PROTECTED]
From: Werner Koch [EMAIL PROTECTED]
Organisation: g10 Code GmbH
Lines: 285
User-Agent: Gnus/5.090006 (Oort Gnus v0.06) Emacs/20.7
(i386-debian-linux-gnu)
Subject: [Announce] GnuPG 1.0.7 released
Sender: [EMAIL PROTECTED]
Date: Tue, 30
Wei Dai writes:
Using a factor base size of 10^9, in the relationship finding phase you
would have to check the smoothness of 2^89 numbers, each around 46 bits
long. (See Frog3's analysis posted at
http://www.mail-archive.com/cryptography%40wasabisystems.com/msg01833.html.
Those numbers
On Wed, May 01, 2002 at 01:37:09AM +0200, Anonymous wrote:
This is probably not the right way to approach the problem. Bernstein's
relation-finding proposal to directly use ECM on each value, while
asymptotically superior to conventional sieving, is unlikely to be
cost-effective for 1024 bit
--
http://www.apache-ssl.org/ben.html http://www.thebunker.net/
There is no limit to what a man can do or how far he can go if he
doesn't mind who gets the credit. - Robert Woodruff
---BeginMessage---
This gem of crypto-related news seems to have slipped by unobserved...
UK leads
11 matches
Mail list logo
