Indent
发表于 2025-3-30 10:28:26
Management, Personal und Organisation order of discriminant . < 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 .., and we show that all methods have comparable
陶瓷
发表于 2025-3-30 12:25:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152999.jpg
conflate
发表于 2025-3-30 16:50:19
https://doi.org/10.1007/978-3-540-79456-1Prime; algebraic geometry; algebraic number fields; algebraic number theory; algorithm; algorithmic numbe
过于光泽
发表于 2025-3-30 21:01:33
http://reply.papertrans.cn/16/1530/152999/152999_54.png
搏斗
发表于 2025-3-31 03:18:29
Algorithmic Number Theory978-3-540-79456-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
Obsessed
发表于 2025-3-31 05:25:39
Das Leistungs- und Produktportfoliomple abelian variety . over the field . of . elements that has an .-rational point of order . and embedding degree . with respect to .. We then discuss how CM-methods over . can be used to explicitly construct ..
受辱
发表于 2025-3-31 09:42:35
http://reply.papertrans.cn/16/1530/152999/152999_57.png
Conflict
发表于 2025-3-31 13:43:29
Management, Personal und Organisationy be obtained. We give an explicit algorithm to generate such curves. We derive a heuristic lower bound for the number .(.) of MNT curves with . = 6 and discriminant . ≤ ., and compare this lower bound with experimental data.
茁壮成长
发表于 2025-3-31 19:08:07
Management, Personal und Organisationup of points of good reduction; this is known to be finite, cyclic if . has multiplicative reduction, and of order at most 4 if . has additive reduction. We show how to compute explicitly an isomorphism . or ..