Microsoft Research330 тыс
Опубликовано 6 сентября 2016, 18:40
This is a report on joint work with Kristin Lauter and Peter Stevenhagen. Broker and Stevenhagen have shown that in practice it is not hard to produce an elliptic curve (over some finite field) with a given number N of points, provided that the factorization of N is known. In his talk this week, Stevenhagen will show that the natural generalization of this method to produce genus-2 curves with a given number of points on their Jacobian is an exponential algorithm. I will consider the related problem of constructing a genus-2 curve over some finite field such that the curve itself has a given number N of points. The idea of explicit
Mars innovates Greenies Smart Essentials campaign with generative AI using AWS | Amazon Web Services