Author:
Faugère Jean-Charles,Goyet Christopher,Renault Guénaël
Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Lecture Notes in Computer Science;L.M. Adleman,1994
2. Lecture Notes in Computer Science;L.M. Adleman,1994
3. Adleman, L.M., DeMarrais, J., Huang, M.-D.A.: A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). Theoretical Computer Science 226(1-2), 7–18 (1999)
4. Ajtai, M.: The shortest vector problem in l
2 is np-hard for randomized reductions (extended abstract). In: Proceedings of the 30th Symposium on the Theory of computing (STOC 1998), pp. 10–19. ACM Press (1998)
5. Ajtai, M.: Generating random lattices according to the invariant distribution. draft (March 2006)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献