150 reputation
5
bio website
location
age
visits member for 1 year, 5 months
seen Mar 20 at 2:24

Aug
7
awarded  Teacher
Mar
20
comment Quadratic Sieve: what's the next step after it fails?
except that those vectors need to be linearly independent for the ½ chance, so there's no reason to construct linear combinations of them. original post updated.
Mar
20
accepted Quadratic Sieve: what's the next step after it fails?
Mar
20
revised Quadratic Sieve: what's the next step after it fails?
deleted 249 characters in body
Mar
19
revised Quadratic Sieve: what's the next step after it fails?
added 151 characters in body
Mar
19
comment Quadratic Sieve: what's the next step after it fails?
I found the problem! A prime number snuck into my list of test numbers, leading me to believe the sieve was having problems that it wasn't. Sorry about that! From this post, I get the impression that the factorization step will always have a very high chance to succeed since 10,000 kernel vectors can be generated and tested in a few seconds.
Mar
19
asked Quadratic Sieve: what's the next step after it fails?
Jul
18
answered Birthday Attack
Jun
26
awarded  Supporter
Jun
26
awarded  Editor
Jun
26
revised Why are elliptic curves better than cyclic groups?
added 2 characters in body
Jun
26
awarded  Scholar
Jun
26
accepted Why are elliptic curves better than cyclic groups?
Jun
26
comment Why are elliptic curves better than cyclic groups?
I'll assume that the weakening of the discrete logarithm refers to the lack of fast algorithms for it over elliptic curves.
Jun
24
awarded  Student
Jun
24
asked Why are elliptic curves better than cyclic groups?