Perhaps an EllipticCurvePrivateNumbers.from_private_number_and_curve() would be appropriate to automatically compute the public key?
Alex On Thu, May 14, 2015 at 12:11 PM, Paul Kehrer <paul.l.keh...@gmail.com> wrote: > Hi Dario, > > The creation of an EllipticCurvePrivateNumbers object does require you to > do d*G yourself at this time. There is some precedent for us adding > functions to compute other elements (see: > https://cryptography.io/en/latest/hazmat/primitives/asymmetric/rsa/#handling-partial-rsa-private-keys) > so a function to do this makes sense to me. > > -Paul > > On May 14, 2015 at 3:21:29 AM, Dario Sneidermanis (dari...@gmail.com) > wrote: > > Hi, > > I'm trying to compute an EllipticCurvePrivateKey from a private_value (d). > It seems that the only way to achieve this is to create an > EllipticCurvePrivateNumbers object, but the constructor takes both the > private_value and the public_numbers. > > Why does it need the public_numbers, when it could compute them (knowing > the curve), by doing d*G (G being the curve generator)? > > Is there any way to go from d to the ECPrivKey without doing d*G by myself? > > Thanks, > Dario > _______________________________________________ > Cryptography-dev mailing list > Cryptography-dev@python.org > https://mail.python.org/mailman/listinfo/cryptography-dev > > > _______________________________________________ > Cryptography-dev mailing list > Cryptography-dev@python.org > https://mail.python.org/mailman/listinfo/cryptography-dev > > -- "I disapprove of what you say, but I will defend to the death your right to say it." -- Evelyn Beatrice Hall (summarizing Voltaire) "The people's good is the highest law." -- Cicero GPG Key fingerprint: 125F 5C67 DFE9 4084
_______________________________________________ Cryptography-dev mailing list Cryptography-dev@python.org https://mail.python.org/mailman/listinfo/cryptography-dev
