Mostrar el registro sencillo del ítem

hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorBIASSE, Jean-François
dc.date.accessioned2024-04-04T02:35:45Z
dc.date.available2024-04-04T02:35:45Z
dc.date.issued2009
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190669
dc.descriptionSoumission au journal Advances in Mathematics of computation
dc.description.abstractEnWe investigate improvements to the algorithm for the computation of ideal class group described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear algebra phase. We achieve a significant speed-up and are able to compute 110-decimal digits discriminant ideal class group in less than a week.
dc.language.isoen
dc.subject.enIdeal Class group
dc.subject.enindex calculus
dc.subject.enlarge prime variant
dc.subject.enGaussian elimination
dc.subject.enHermite normal form
dc.title.enImprovements in the computation of ideal class groups of imaginary quadratic number fields
dc.typeAutre document
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierinria-00397408
hal.version1
hal.popularnon
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00397408v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2009&rft.au=BIASSE,%20Jean-Fran%C3%A7ois&rft.genre=unknown


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