Article
Open Access
Finding discrete logarithms with a set orbit distinguisher
-
Robert P. Gallant
Published/Copyright:
May 26, 2012
Received: 2010-06-08
Revised: 2012-02-08
Accepted: 2012-02-09
Published Online: 2012-05-26
Published in Print: 2012-June
© 2012 by Walter de Gruyter Berlin Boston
Keywords for this article
Discrete logarithm problem;
complexity;
sparse polynomial;
quadratic residue codes
Creative Commons
BY-NC-ND 3.0
