Factorisation patterns of division polynomials

dc.contributor.author	Verdure, Hugues
dc.date.accessioned	2008-04-23T08:15:44Z
dc.date.available	2008-04-23T08:15:44Z
dc.date.issued	2004-05
dc.description.abstract	The choice of an elliptic curve for the implementa- tion of an elliptic curve cryptosystem requires count- ing the number of points on such a curve over a fi- nite field. An improvement of Schoof’s algorithm for counting the number of rational points on an ellip- tic curve defined over a finite field takes advantage of some factor of the division polynomials. In this paper, we study the possible factorisations of such division polynomials.	en
dc.format.extent	65678 bytes
dc.format.extent	170170 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/pdf
dc.identifier.issn	0386-2194
dc.identifier.uri	https://hdl.handle.net/10037/1405
dc.identifier.urn	URN:NBN:no-uit_munin_1183
dc.language.iso	eng	en
dc.publisher	Japan Academy	en
dc.relation.ispartofseries	Proceedings of the Japan Academy / Series A Mathematical sciences 80(2004) nr. 5, s. 79-82	en
dc.rights.accessRights	openAccess
dc.subject	VDP::Matematikk og naturvitenskap: 400::Matematikk: 410::Algebra/algebraisk analyse: 414	en
dc.subject	Mathematics subject classification : 14H52, 11T71	en
dc.subject	Elliptic curve	en
dc.subject	division polynomial	en
dc.subject	factorisation	en
dc.title	Factorisation patterns of division polynomials	en
dc.type	Journal article	en
dc.type	Tidsskriftartikkel	en
dc.type	Peer reviewed	en