261 reputation
16
bio website
location
age
visits member for 2 years, 2 months
seen Oct 9 at 16:34

May
28
comment Size of Parameters in Polynomial Key-Splitting Algorithm
@D.W. I know a little bit about finite fields, and I think I know where I went wrong: $GF(p)$ is the same as working $\bmod\,p$, but $GF(p^n)$ is not the same as working $\bmod\,p^n$, right? This means that while two is prime, $\bmod\,2^n$ is not actually a finite field.
May
28
comment Size of Parameters in Polynomial Key-Splitting Algorithm
@jug Is there a security reason for using a finite field, because the row reduction seems easier without a finite field.
May
27
comment Size of Parameters in Polynomial Key-Splitting Algorithm
@jug So I would take everything $ \bmod \,2^n$ for example, where $n$ is the size of $K$?
May
10
comment Finding hash almost-collisions
Cool! I didn't realize hardware could make all the difference.