Skip to main content
9 events
when toggle format what by license comment
Feb 18, 2016 at 18:35 comment added otus @JaimeCastells, On the contrary, it is well known that the algorithm scales "well" compared to raw size. See the duplicate and this question. The main reason nothing larger than 768 bits has been (publicly) factored may be that 1024 bits is the next "standard" size and one wouldn't expect it to have been factored just yet (on an academic budget).
Feb 18, 2016 at 18:23 history edited Azarinak CC BY-SA 3.0
Clarified the DH comment
Feb 18, 2016 at 14:34 comment added JaimeCastells Certainly primes are sparsely distributed, roughly .04% of numbers on the order of 2^1024 I believe. None the less, going from a field of 2^768 to a field 2^256 times as large provides very many indeed. In fact the sparseness is utterly dwarfed by the exponential multiplication in the size of the field. I believe the number of primes is increased by roughly 2^242 times.
Feb 18, 2016 at 14:32 comment added JaimeCastells I suppose what's bothering me here is that these are all "soft" arguments and seem to amount to little more than F.U.D. No one has demonstrated successful factoring of 800 bit RSA numbers, which is much harder than 768 bit. The methods used to factor the 768 bit number are known to not scale well and no better alternatives are documented, to my knowledge.
Feb 18, 2016 at 9:04 review Suggested edits
Feb 18, 2016 at 11:16
S Feb 18, 2016 at 5:04 history suggested Nayuki CC BY-SA 3.0
Improved spelling and syntax
Feb 18, 2016 at 3:26 review Suggested edits
S Feb 18, 2016 at 5:04
Feb 17, 2016 at 22:19 comment added Azarinak And if you're interested in a paper that attacks 1024 DHE, check out the Logjam attack where it claims a reasonable amount of computation could break commonly used configurations. weakdh.org
Feb 17, 2016 at 22:04 history answered Azarinak CC BY-SA 3.0