Show simple item record

hal.structure.identifierEcole Polytechnique Fédérale de Lausanne [EPFL]
dc.contributor.authorKLEINJUNG, Thorsten
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorWESOLOWSKI, Benjamin
dc.date.accessioned2024-04-04T02:45:35Z
dc.date.available2024-04-04T02:45:35Z
dc.date.issued2022
dc.identifier.issn0894-0347
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191481
dc.description.abstractEnWe prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality $p^n$ in expected time $(pn)^{2\log_2(n) + O(1)}$.
dc.language.isoen
dc.publisherAmerican Mathematical Society
dc.title.enDiscrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
dc.typeArticle de revue
dc.identifier.doi10.1090/jams/985
dc.subject.halInformatique [cs]/Arithmétique des ordinateurs
dc.description.sponsorshipEuropeAlgebraic Methods for Stronger Crypto
bordeaux.journalJournal of the American Mathematical Society
bordeaux.page581-624
bordeaux.volume35
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-03347994
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03347994v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20the%20American%20Mathematical%20Society&rft.date=2022&rft.volume=35&rft.spage=581-624&rft.epage=581-624&rft.eissn=0894-0347&rft.issn=0894-0347&rft.au=KLEINJUNG,%20Thorsten&WESOLOWSKI,%20Benjamin&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record