ciphergoth: (Default)
[personal profile] ciphergoth
I've been waiting to hear from one of the really heavyweight experts whether there's any meat behind Bernstein's fast factoring proposals before saying anything.

Bob Silverman just posted a first impression to sci.crypt; he can't see why it wouldn't be practical, and is now recommending 2048-bit keys instead of the 1024-bit keys he used to recommend.

Date: 2002-03-01 12:34 am (UTC)
lovingboth: (Default)
From: [personal profile] lovingboth
Yeah, but for factoring large numbers you're talking pure mathematics and ways to make things easier rather than easy.

Date: 2002-03-01 02:45 am (UTC)
From: [identity profile] ciphergoth.livejournal.com
Well, the same is true for finding discrete logarithms over elliptic curves or Schnorr groups, but the shortcuts there (in the general case) aren't up to much more than a square root of brute force attack (they're based on collision finding). I don't think I know what you're getting at. If every attack is always destined to be succeeded by an exponentially better one, we might as well give up and go home.

Profile

ciphergoth: (Default)
Paul Crowley

January 2025

S M T W T F S
   1234
5678 91011
12131415161718
19202122232425
262728293031 

Most Popular Tags

Page Summary

Style Credit

Expand Cut Tags

No cut tags
Page generated Dec. 29th, 2025 08:51 am
Powered by Dreamwidth Studios