1. Bardet, M., Faugére, J.C., Salvy, B.: Complexity of gröbner basis computation for semi-regular overdetermined sequences over $$\mathbb{F}_2$$ with solutions in $$\mathbb{F}_2$$. techreport 5049. Institut National de Recherche en Informatique et en Automatique (INRIA) (2003)
2. Lecture Notes in Computer Science;P Fauzi,2021
3. Bouillaguet, C., Faugère, J.C., Fouque, P.A., Perret, L.: Isomorphism of polynomials: New results (2011)
4. Casanova, A., Faugere, J.-C., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: Gemss, technical report, national institute of standards and technology (2019). https://csrc.nist.gov/projects/post-quantum-cryptography/round-2-submissions
5. Chen, J., Tan, C.H., Li, X.: Practical cryptanalysis of a public key cryptosystem based on the morphism of polynomials problem. Tsinghua Sci. Technol 23(6), 671–679 (2018)