MHB How to Use Elliptic Curve Cryptography to Find Inverses and Points on the Curve?

Click For Summary
To solve the elliptic curve equations y² = x³ + x + 1 mod 17 and y² = x³ + 3x + 1 mod 13, one approach is to evaluate the equations for all integer values of x within the specified modulus. This method allows for the identification of all points on the curve. Once the points are determined, inverses can also be calculated based on the results. Additionally, visualizing the curves by plotting the points can enhance understanding of the relationships between them. This process aids in improving calculus skills related to elliptic curve cryptography.
vokoyo
Messages
9
Reaction score
0
May I know how to solve the equation as below:

(1) y2 = x3 + x + 1 mod 17

Finding Inverses
Finding Points on the Curve

(2) y2 = x3 + 3x + 1 mod 13

Finding Inverses
Finding Points on the Curve
 
Last edited by a moderator:
Mathematics news on Phys.org
vokoyo said:
May I know how to solve the equation as below:

(1) y2 = x3 + x + 1 mod 17

Finding Inverses
Finding Points on the Curve

Hi vokoyo,

How about filling in $x=0, ..., 16$.
Those are all the relevant possibilities for $x$.
After that the same results will appear periodically.

That way we find all the points on the curve.
And from the results we can also find all inverses, can't we?
 
Thank you very much for your advice and suggestion

Please show me your sample solution draft
so that I can improve my calculus skills

I fact I would like to draw the curve line or point by point
 
Last edited by a moderator:

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
11
Views
6K
Replies
1
Views
1K
  • · Replies 11 ·
Replies
11
Views
3K
Replies
13
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K