In this thesis, I show that the representation of prime integers by reduced binary quadratic forms of given discriminant can be obtained in polynomial complexity using Schoof's algorithm for counting the number of points of elliptic curves over finite fields. It is a remarkable fact that, although an algorithm of Gauss' solved the representation problem long time ago, a solution in polynomial complexity is very recent and almost unnoticed in the literature. Further, I present a viable alternative to Gauss' algorithm, which constitutes the main original contribution of my thesis. This alternative way of computing in polynomial time an explicit solution of the representation problem is particularly suitable whenever the number of not equivalent reduced forms is small.
Lastly, I report that, in the efforts of improving Schoof's algorithm, a marginal incompleteness in its original formulation was identified. This weakness was eliminated by a slight modification of the algorithm suggested by Schoof himself.
| Identifer | oai:union.ndltd.org:unitn.it/oai:iris.unitn.it:11572/367967 |
| Date | January 2015 |
| Creators | Pintore, Federico |
| Contributors | Pintore, Federico, Sala, Massimiliano |
| Publisher | Università degli studi di Trento, place:TRENTO |
| Source Sets | Università di Trento |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/doctoralThesis |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | firstpage:1, lastpage:123, numberofpages:123 |
Page generated in 0.0021 seconds