The equivariant complexity of multiplication in finite field extensions
hal.structure.identifier | Université de Bordeaux [UB] | |
hal.structure.identifier | Institut Polytechnique de Bordeaux [Bordeaux INP] | |
hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
hal.structure.identifier | Analyse cryptographique et arithmétique [CANARI] | |
dc.contributor.author | COUVEIGNES, Jean-Marc | |
hal.structure.identifier | Université des Sciences et Techniques de Masuku [USTM] | |
dc.contributor.author | EZOME, Tony | |
dc.date.issued | 2023-05 | |
dc.identifier.issn | 0021-8693 | |
dc.description.abstractEn | 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. | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.rights.uri | http://creativecommons.org/licenses/by/ | |
dc.title.en | The equivariant complexity of multiplication in finite field extensions | |
dc.type | Article de revue | |
dc.identifier.doi | 10.1016/j.jalgebra.2023.01.022 | |
dc.subject.hal | Mathématiques [math]/Théorie des nombres [math.NT] | |
dc.identifier.arxiv | 2110.13763 | |
bordeaux.journal | Journal of Algebra | |
bordeaux.page | 694-720 | |
bordeaux.volume | 622 | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-03410146 | |
hal.version | 1 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-03410146v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Algebra&rft.date=2023-05&rft.volume=622&rft.spage=694-720&rft.epage=694-720&rft.eissn=0021-8693&rft.issn=0021-8693&rft.au=COUVEIGNES,%20Jean-Marc&EZOME,%20Tony&rft.genre=article |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |