Obtaining elliptic curve solution in integers from solution in quadratic field












3












$begingroup$


Are there any methods or known tricks to obtain elliptic curve solutions in the integers from a solution in a quadratic field?



Starting with a Mordell curve:
$$y^2 = x^3 + k$$
Consider an integer $p$ such that $k-p = -c^3$. This let's us write:
$$(y+sqrt{p})(y-sqrt{p}) = (x-c)(x^2 + cx + c^2)$$
Since a number has roughly 1/log(n) chance of being a prime, in practice it isn't hard to search possible values of $c^3$ til we get $p$ a prime. And because the class number of $mathbb{Q}(sqrt{p})$ is often 1 for prime p, we can even search until we find one that gives us a unique factorization domain in case that helps.



So now we have this nice factorization in a unique factorization domain, giving us a point on the curve in $mathbb{Q}(sqrt{p})$. And since it is on an elliptic curve, we can find new solutions by adding together old solutions.



Is there a way to leverage any of this to obtain solutions in $mathbb{Q}$ and hopefully even $mathbb{Z}$?






number-theory elliptic-curves mordell-curves







share|cite|improve this question









$endgroup$

















    3












    $begingroup$


    Are there any methods or known tricks to obtain elliptic curve solutions in the integers from a solution in a quadratic field?



    Starting with a Mordell curve:
    $$y^2 = x^3 + k$$
    Consider an integer $p$ such that $k-p = -c^3$. This let's us write:
    $$(y+sqrt{p})(y-sqrt{p}) = (x-c)(x^2 + cx + c^2)$$
    Since a number has roughly 1/log(n) chance of being a prime, in practice it isn't hard to search possible values of $c^3$ til we get $p$ a prime. And because the class number of $mathbb{Q}(sqrt{p})$ is often 1 for prime p, we can even search until we find one that gives us a unique factorization domain in case that helps.



    So now we have this nice factorization in a unique factorization domain, giving us a point on the curve in $mathbb{Q}(sqrt{p})$. And since it is on an elliptic curve, we can find new solutions by adding together old solutions.



    Is there a way to leverage any of this to obtain solutions in $mathbb{Q}$ and hopefully even $mathbb{Z}$?






    number-theory elliptic-curves mordell-curves







    share|cite|improve this question









    $endgroup$















      3












      3








      3


      1



      $begingroup$


      Are there any methods or known tricks to obtain elliptic curve solutions in the integers from a solution in a quadratic field?



      Starting with a Mordell curve:
      $$y^2 = x^3 + k$$
      Consider an integer $p$ such that $k-p = -c^3$. This let's us write:
      $$(y+sqrt{p})(y-sqrt{p}) = (x-c)(x^2 + cx + c^2)$$
      Since a number has roughly 1/log(n) chance of being a prime, in practice it isn't hard to search possible values of $c^3$ til we get $p$ a prime. And because the class number of $mathbb{Q}(sqrt{p})$ is often 1 for prime p, we can even search until we find one that gives us a unique factorization domain in case that helps.



      So now we have this nice factorization in a unique factorization domain, giving us a point on the curve in $mathbb{Q}(sqrt{p})$. And since it is on an elliptic curve, we can find new solutions by adding together old solutions.



      Is there a way to leverage any of this to obtain solutions in $mathbb{Q}$ and hopefully even $mathbb{Z}$?






      number-theory elliptic-curves mordell-curves







      share|cite|improve this question









      $endgroup$




      Are there any methods or known tricks to obtain elliptic curve solutions in the integers from a solution in a quadratic field?



      Starting with a Mordell curve:
      $$y^2 = x^3 + k$$
      Consider an integer $p$ such that $k-p = -c^3$. This let's us write:
      $$(y+sqrt{p})(y-sqrt{p}) = (x-c)(x^2 + cx + c^2)$$
      Since a number has roughly 1/log(n) chance of being a prime, in practice it isn't hard to search possible values of $c^3$ til we get $p$ a prime. And because the class number of $mathbb{Q}(sqrt{p})$ is often 1 for prime p, we can even search until we find one that gives us a unique factorization domain in case that helps.



      So now we have this nice factorization in a unique factorization domain, giving us a point on the curve in $mathbb{Q}(sqrt{p})$. And since it is on an elliptic curve, we can find new solutions by adding together old solutions.



      Is there a way to leverage any of this to obtain solutions in $mathbb{Q}$ and hopefully even $mathbb{Z}$?






      number-theory elliptic-curves mordell-curves




      number-theory elliptic-curves mordell-curves






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 10 at 16:14









      PineDoorsPineDoors

      335




      335






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Maybe there are other ways to proceed, but at least the naive approach of adding the initial point hoping to find a rational point will not work.



          The initial point found will be linearly independent of any rational point. So changing to the quadratic field to get an initial point just increases the rank, or adds to the torsion group.




          This can be seen by writing out the addition formulas. (I started with the explicit addition formulas from here: https://crypto.stanford.edu/pbc/notes/elliptic/explicit.html )



          I am unsure of the terminology for the parts of a value in a real quadratic number field, so for terminology convenience and without loss of generality let's consider an imaginary quadratic field.



          Our initial point has $y$ purely imaginary, and $x$ real valued. The group structure on the Mordell curve preserves this, so this will never lead to a rational point.



          Following the doubling algorithm, simplified for a Mordell curve, is:
          $$
          begin{eqnarray}
          lambda &=& frac{3x_1^2}{2y_1} & text{(purely imaginary)}\
          x_3 &=& lambda^2 - 2 x_1 & text{(real)} \
          y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
          end{eqnarray}
          $$
          And the addition formula:
          $$
          begin{eqnarray}
          lambda &=& frac{y_2 - y_1}{x_2-x_1} & text{(purely imaginary)}\
          x_3 &=& lambda^2 - x_1 - x_2 & text{(real)} \
          y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
          end{eqnarray}
          $$






          share|cite|improve this answer











          $endgroup$














            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068835%2fobtaining-elliptic-curve-solution-in-integers-from-solution-in-quadratic-field%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            0












            $begingroup$

            Maybe there are other ways to proceed, but at least the naive approach of adding the initial point hoping to find a rational point will not work.



            The initial point found will be linearly independent of any rational point. So changing to the quadratic field to get an initial point just increases the rank, or adds to the torsion group.




            This can be seen by writing out the addition formulas. (I started with the explicit addition formulas from here: https://crypto.stanford.edu/pbc/notes/elliptic/explicit.html )



            I am unsure of the terminology for the parts of a value in a real quadratic number field, so for terminology convenience and without loss of generality let's consider an imaginary quadratic field.



            Our initial point has $y$ purely imaginary, and $x$ real valued. The group structure on the Mordell curve preserves this, so this will never lead to a rational point.



            Following the doubling algorithm, simplified for a Mordell curve, is:
            $$
            begin{eqnarray}
            lambda &=& frac{3x_1^2}{2y_1} & text{(purely imaginary)}\
            x_3 &=& lambda^2 - 2 x_1 & text{(real)} \
            y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
            end{eqnarray}
            $$
            And the addition formula:
            $$
            begin{eqnarray}
            lambda &=& frac{y_2 - y_1}{x_2-x_1} & text{(purely imaginary)}\
            x_3 &=& lambda^2 - x_1 - x_2 & text{(real)} \
            y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
            end{eqnarray}
            $$






            share|cite|improve this answer











            $endgroup$


















              0












              $begingroup$

              Maybe there are other ways to proceed, but at least the naive approach of adding the initial point hoping to find a rational point will not work.



              The initial point found will be linearly independent of any rational point. So changing to the quadratic field to get an initial point just increases the rank, or adds to the torsion group.




              This can be seen by writing out the addition formulas. (I started with the explicit addition formulas from here: https://crypto.stanford.edu/pbc/notes/elliptic/explicit.html )



              I am unsure of the terminology for the parts of a value in a real quadratic number field, so for terminology convenience and without loss of generality let's consider an imaginary quadratic field.



              Our initial point has $y$ purely imaginary, and $x$ real valued. The group structure on the Mordell curve preserves this, so this will never lead to a rational point.



              Following the doubling algorithm, simplified for a Mordell curve, is:
              $$
              begin{eqnarray}
              lambda &=& frac{3x_1^2}{2y_1} & text{(purely imaginary)}\
              x_3 &=& lambda^2 - 2 x_1 & text{(real)} \
              y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
              end{eqnarray}
              $$
              And the addition formula:
              $$
              begin{eqnarray}
              lambda &=& frac{y_2 - y_1}{x_2-x_1} & text{(purely imaginary)}\
              x_3 &=& lambda^2 - x_1 - x_2 & text{(real)} \
              y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
              end{eqnarray}
              $$






              share|cite|improve this answer











              $endgroup$
















                0












                0








                0





                $begingroup$

                Maybe there are other ways to proceed, but at least the naive approach of adding the initial point hoping to find a rational point will not work.



                The initial point found will be linearly independent of any rational point. So changing to the quadratic field to get an initial point just increases the rank, or adds to the torsion group.




                This can be seen by writing out the addition formulas. (I started with the explicit addition formulas from here: https://crypto.stanford.edu/pbc/notes/elliptic/explicit.html )



                I am unsure of the terminology for the parts of a value in a real quadratic number field, so for terminology convenience and without loss of generality let's consider an imaginary quadratic field.



                Our initial point has $y$ purely imaginary, and $x$ real valued. The group structure on the Mordell curve preserves this, so this will never lead to a rational point.



                Following the doubling algorithm, simplified for a Mordell curve, is:
                $$
                begin{eqnarray}
                lambda &=& frac{3x_1^2}{2y_1} & text{(purely imaginary)}\
                x_3 &=& lambda^2 - 2 x_1 & text{(real)} \
                y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
                end{eqnarray}
                $$
                And the addition formula:
                $$
                begin{eqnarray}
                lambda &=& frac{y_2 - y_1}{x_2-x_1} & text{(purely imaginary)}\
                x_3 &=& lambda^2 - x_1 - x_2 & text{(real)} \
                y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
                end{eqnarray}
                $$






                share|cite|improve this answer











                $endgroup$



                Maybe there are other ways to proceed, but at least the naive approach of adding the initial point hoping to find a rational point will not work.



                The initial point found will be linearly independent of any rational point. So changing to the quadratic field to get an initial point just increases the rank, or adds to the torsion group.




                This can be seen by writing out the addition formulas. (I started with the explicit addition formulas from here: https://crypto.stanford.edu/pbc/notes/elliptic/explicit.html )



                I am unsure of the terminology for the parts of a value in a real quadratic number field, so for terminology convenience and without loss of generality let's consider an imaginary quadratic field.



                Our initial point has $y$ purely imaginary, and $x$ real valued. The group structure on the Mordell curve preserves this, so this will never lead to a rational point.



                Following the doubling algorithm, simplified for a Mordell curve, is:
                $$
                begin{eqnarray}
                lambda &=& frac{3x_1^2}{2y_1} & text{(purely imaginary)}\
                x_3 &=& lambda^2 - 2 x_1 & text{(real)} \
                y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
                end{eqnarray}
                $$
                And the addition formula:
                $$
                begin{eqnarray}
                lambda &=& frac{y_2 - y_1}{x_2-x_1} & text{(purely imaginary)}\
                x_3 &=& lambda^2 - x_1 - x_2 & text{(real)} \
                y_3 &=& - lambda x_3 + lambda x_1 - y_1 quad & text{(purely imaginary)} \
                end{eqnarray}
                $$







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Jan 12 at 8:29

























                answered Jan 12 at 8:22









                PineDoorsPineDoors

                335




                335






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068835%2fobtaining-elliptic-curve-solution-in-integers-from-solution-in-quadratic-field%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    -

                    Popular posts from this blog

                    Bressuire

                    Image
                    .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
                    Read more

                    Cabo Verde

                    Image
                      Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
                    Read more

                    Gyllenstierna

                    Image
                    .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
                    Read more