Stack Exchange
sign up
|
log in
|
Cryptography
beta
Questions
Tags
Tour
Users
Ask Question
Badge
Editor
First edit.
Samuel Neves earned this badge
aug 19 '11 at 12:02
How robust is discrete logarithm in GF(2^n) ?
Others with this badge
Cryptography Stack Exchange works best with JavaScript enabled