Show simple item record

hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorDUPONT, Régis
hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorENGE, Andreas
hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorMORAIN, François
dc.date.issued2005
dc.identifier.issn0933-2790
dc.description.abstractEnWe present a fast algorithm for building ordinary elliptic curves over finite prime fields having arbitrary small MOV degree. The elliptic curves are obtained using complex multiplication by any desired discriminant.
dc.language.isoen
dc.publisherSpringer Verlag
dc.subject.enelliptic curves over finite fields
dc.subject.enMOV degree
dc.subject.encomplex multiplication
dc.title.enBuilding curves with arbitrary small MOV degree over finite prime fields
dc.typeArticle de revue
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
bordeaux.journalJournal of Cryptology
bordeaux.page79-89
bordeaux.volume18
bordeaux.issue2
bordeaux.peerReviewedoui
hal.identifierinria-00386299
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00386299v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Cryptology&rft.date=2005&rft.volume=18&rft.issue=2&rft.spage=79-89&rft.epage=79-89&rft.eissn=0933-2790&rft.issn=0933-2790&rft.au=DUPONT,%20R%C3%A9gis&ENGE,%20Andreas&MORAIN,%20Fran%C3%A7ois&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