Afficher la notice abrégée

hal.structure.identifierDepartment of Mathematics [College Park]
dc.contributor.authorBELDING, Juliana
hal.structure.identifierMicrosoft Research [Redmond]
dc.contributor.authorBRÖKER, Reinier
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorENGE, Andreas
hal.structure.identifierMicrosoft Research [Redmond]
dc.contributor.authorLAUTER, Kristin
dc.contributor.editorAlfred J. van der Poorten, Andreas Stein
dc.date.issued2008
dc.date.conference2008-05-17
dc.description.abstractEnWe present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing $H_D$ , and we show that all methods have comparable run times.
dc.language.isoen
dc.publisherSpringer-Verlag
dc.subject.enclass polynomial
dc.subject.enp-adic lifting
dc.subject.enalgorithm
dc.subject.encomplexity
dc.title.enComputing Hilbert Class Polynomials
dc.typeCommunication dans un congrès avec actes
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
dc.identifier.arxiv0802.0979
bordeaux.page282-295
bordeaux.volume5011
bordeaux.countryCA
bordeaux.title.proceedingANTS-VIII - Eighth Algorithmic Number Theory Symposium
bordeaux.conference.cityBanff
bordeaux.peerReviewedoui
hal.identifierinria-00246115
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00246115v1
bordeaux.COinSctx_ver=Z39.88-2004&amp;rft_val_fmt=info:ofi/fmt:kev:mtx:journal&amp;rft.date=2008&amp;rft.volume=5011&amp;rft.spage=282-295&amp;rft.epage=282-295&amp;rft.au=BELDING,%20Juliana&amp;BR%C3%96KER,%20Reinier&amp;ENGE,%20Andreas&amp;LAUTER,%20Kristin&amp;rft.genre=proceeding


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée