Mostrar el registro sencillo del ítem

The equivariant complexity of multiplication in finite field extensions

hal.structure.identifierUniversité de Bordeaux [UB]
hal.structure.identifierInstitut Polytechnique de Bordeaux [Bordeaux INP]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
hal.structure.identifierAnalyse cryptographique et arithmétique [CANARI]
dc.contributor.authorCOUVEIGNES, Jean-Marc
hal.structure.identifierUniversité des Sciences et Techniques de Masuku [USTM]
dc.contributor.authorEZOME, Tony
dc.date.issued2023-05
dc.identifier.issn0021-8693
dc.description.abstractEnWe 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.isoen
dc.publisherElsevier
dc.rights.urihttp://creativecommons.org/licenses/by/
dc.title.enThe equivariant complexity of multiplication in finite field extensions
dc.typeArticle de revue
dc.identifier.doi10.1016/j.jalgebra.2023.01.022
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
dc.identifier.arxiv2110.13763
bordeaux.journalJournal of Algebra
bordeaux.page694-720
bordeaux.volume622
bordeaux.peerReviewedoui
hal.identifierhal-03410146
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03410146v1
bordeaux.COinSctx_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


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem