References
- L. Caniglia, G. Cortilnas, S. Danon, J. Heintz, T. Krick, and P. Solerno, Algorithmic aspects of Suslin's proof of Serre's conjecture, Comput. Complex. 3 (1993), pp. 31–55.
- A.L. Chistov and D. Yu. Grigoriev, Complexity of quantifier elimination in the theory of algebraically closed fields, in Mathematical Foundations of Computer Science (Prague, 1984), Lecture Notes in Comput. Sci. Vol. 176, Springer, Berlin, 1984, 17–31.
- J. Ding and T. Hodges, Cryptanalysis of an implementation scheme of the tamed transformation method cryptosystem, J. Algebra Appl. 3 (2004), pp. 273–282.
- H. Lombardi and I. Yengui, Suslin's algorithms for reduction of unimodular rows, J. Symbolic Comput.39 (2005), pp. 707–717.
- T.T. Moh, A public key system with signature and master key functions, Comm. Algebra 27 (1999), pp. 2207–2222.
- NIST, Post-Quantum Cryptography: Digital Signature Schemes. Available at https://csrc.nist.gov/csrc/media/Projects/pqc-dig-sig/documents/call-for-proposals-dig-sig-sept-2022.pdf.
- D. Quillen, Projective modules over polynomial rings, Invent. Math. 36 (1976), pp. 167–171.
- P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997), pp. 1484–1509.
- V. Shpilrain and J.-T. Yu, Polynomial automorphisms and Gröbner reductions, J. Algebra 197 (1997), pp. 546–558.
- A. Suslin, Projective modules over polynomial rings are free, Dokl. Akad. Nauk SSSR 229 (1976), pp. 1063–1066.