{
  "id": "2110.13763",
  "version": "v2",
  "published": "2021-10-26T15:15:16.000Z",
  "updated": "2022-12-30T16:24:58.000Z",
  "title": "The equivariant complexity of multiplication in finite field extensions",
  "authors": [
    "Jean-Marc Couveignes",
    "Tony Ezome"
  ],
  "categories": [
    "math.NT"
  ],
  "abstract": "We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2022-12-30T16:24:58.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "finite field extension",
      "equivariant complexity",
      "multiplication",
      "normal basis",
      "algebraic curves"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}