Back to Results
First PageMeta Content
Group 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 Renault1
Add to Reading List

Document Date: 2012-04-20 07:14:48

Open Document

File Size: 430,57 KB

Share Result on Facebook

Country

Belgium / France / /

Currency

pence / /

/

IndustryTerm

finite cyclic / ad-hoc algorithm / sub-exponential index calculus algorithm / /

Position

Motivation General / Prime Minister / /

Product

Rx / /

Technology

approach Algorithm / no sub-exponential index calculus algorithm / ad-hoc algorithm / DLP / times Generic algorithms / /

SocialTag