First Page | Document Content | |
---|---|---|
Date: 2012-04-20 07:14:48Group theory Cryptography Logarithms Computational hardness assumptions Index calculus algorithm Discrete logarithm Elliptic curve XTR Polynomial Abstract algebra Algebra Finite fields | Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields Jean-Charles Faug`ere1 Ludovic Perret1 Gu´ena¨el Renault1Add to Reading ListSource URL: www.iacr.orgDownload Document from Source WebsiteFile Size: 430,57 KBShare Document on Facebook |