Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with elliptic-curves
Search options not deleted
user 53946
Elliptic curves are algebraic-geometric structures with applications in cryptography. Such a curve consists of the set of solutions to a cubic equation over a finite field equipped with a group operation. Questions relating to elliptic curves and derived algorithms should use this tag and might also consider more specific tags such as discrete-logarithm and ecdsa.
1
vote
1
answer
97
views
Evaluation of polynomial when using elliptic curves for verifiable secret sharing
I am implementing the following the algorithm instructions as shown in 1 (section IV, B).
When trying to verify the share given the commits, $a_jG$ verifier $i$ checks whether $f(i)G=\sum_{j=0}^{t} (x …
- 229
0
votes
1
answer
229
views
The equivalence of exponentiation and multiplication over elliptic curves
I am trying to convert $(g^a)^{i^2}\mod p$ to an equivalent Elliptic Curve expression.
Let's assume a base point $G$ over an appropriate ECC.
Will $(g^a)^{i^2}\mod p$ be equivalent to $G\cdot a\cdot i …
- 229