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 106299
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.
2
votes
The elliptic curve $y^2 = x^3 \pmod p$
Fix the generator $G=(1,1)$. Given a point $kG = (x,y)$ on this curve, one can calculate $k=x/y$.
So there is a very simple algorithm to perform point to point division.
- 225
1
vote
1
answer
146
views
The elliptic curve $y^2 = x^3 \pmod p$
Consider the solutions of the equation $y^2 = x^3 \pmod p$ for some prime $p=6k+1$. When considered as an elliptic curve, it has a cusp at $(0, 0)$, and addition involving this point doesn't work out. …
- 225
1
vote
2
answers
97
views
Has the ideal "pairing" $\langle aG, bG\rangle \mapsto abG$ been ruled out conditionally?
Let $G$ be a prime order $Q$ elliptic curve over a prime field of size $P$ which admits the following mapping $f$
$f(aG, bG) = abG$
which can be computed in polynomial time in $\log(PQ)$.
Is the exist …
- 225
0
votes
1
answer
54
views
Set ECDLP complexity
Consider the following problem which is an easier version of the EC discrete log problem. Fix an elliptic curve and a generator $G$. Given an arbitrary set of points $S$, the task is to find $k$ such …
- 225