S. Aaronson and P. Christiano, Quantum money from hidden subspaces, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.41-60, 2012.
DOI : 10.1145/2213977.2213983

M. Bardet, J. Faugère, and B. Salvy, On the complexity of Gröbner basis computation of semiregular overdetermined algebraic equations, Proc. of International Conference on Polynomial System Solving (ICPSS), pp.71-75, 2004.

M. Bardet, J. Faugère, and B. Salvy, On the Complexity of the F5 Gr¨bnerGr¨ Gr¨bner basis Algorithm, Journal of Symbolic Computation, pp.1-24, 2014.

M. Bardet, J. Faugère, B. Salvy, and B. Yang, Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 2005.

C. H. Bennett, G. Brassard, S. Breidbard, and S. Wiesner, Quantum Cryptography, or Unforgeable Subway Tokens, Proceedings of CRYPTO, pp.267-275, 1982.
DOI : 10.1007/978-1-4757-0602-4_26

W. Bosma, J. J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4235, 1997.
DOI : 10.1006/jsco.1996.0125

P. Richard, B. D. Brent, and . Mckay, Determinants and rank of random matrices over Zm, Discrete Math, vol.66, pp.35-50, 1987.

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

B. Buchberger, Bruno Buchberger???s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Journal of Symbolic Computation, vol.41, issue.3-4, pp.3-4475, 2006.
DOI : 10.1016/j.jsc.2005.09.007

B. Buchberger, Comments on the translation of my PhD thesis, Journal of Symbolic Computation, vol.41, issue.3-4, pp.471-474, 2006.
DOI : 10.1016/j.jsc.2005.09.008

N. Courtois and W. Meier, Algebraic attacks on stream ciphers with linear feedback, Advances in Cryptology -EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, volume 2656 of Lecture Notes in Computer Science, pp.345-359, 2003.

E. Farhi, D. Gosset, A. Hassidim, A. Lutomirski, and P. W. Shor, Quantum money from knots, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on, ITCS '12, pp.276-289, 2012.
DOI : 10.1145/2090236.2090260
URL : http://arxiv.org/abs/1004.5127

J. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

J. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), International Symposium on Symbolic and Algebraic Computation-ISAAC 2002, pp.75-83, 2002.

J. Faugère and A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gröbner bases, Advances in Cryptology -CRYPTO 2003, 23rd Annual International Cryptology Conference Proceedings, volume 2729 of Lecture Notes in Computer Science, pp.44-60, 2003.

J. Faugère and L. Perret, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Advances in Cryptology -EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, pp.30-47, 2006.
DOI : 10.1007/11761679_3

D. Gavinsky, Quantum money with classical verification, pp.42-52, 2012.

M. Mosca and D. Stebila, Quantum coins. Error-Correcting Codes, Finite Geometry and Cryptography, pp.35-47, 2010.

J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Advances in Cryptology -EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, pp.33-48, 1996.
DOI : 10.1007/3-540-68339-9_4

S. Wiesner, Conjugate coding, ACM SIGACT News, vol.15, issue.1, pp.78-88, 1983.
DOI : 10.1145/1008908.1008920