forked from BitVM/BitVM
-
Notifications
You must be signed in to change notification settings - Fork 2
BN254 Curve Operations
sevkett12 edited this page Jan 9, 2025
·
2 revisions
The elliptic curve
- The prime
$p$ is big enough for security and satisfies some modular conditions. - Number of solutions of the curve over
$F_p$ (called$r$ ) is prime. - Embedding degree(
$k$ ) of BN254 curve (minimum positive integer which satisfies$r|p^k-1$ ) is 12. 12 is one of the optimal options for embedding degree because if embedding degree is large, it is hard to make calculations; if embedding degree is low, the curve security is not good enough. For more detailed explanation
Since embedding degree of BN254 curve is 12, we want to represent
Alternatively,
Note: In ourcode base
We want to construct a group scructure of BN254 curve with operation curve addition.