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-curve-generation
Search options answers only
not deleted
user 555
ECC is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security. Elliptic curves are applicable for key agreement, digital signatures, pseudorandom generators, and other tasks. they can be used for encryption by combining the key agreement with an asymmetric encryption scheme.
2
votes
in elliptic curve over finite field we get two values of y for each x now how can we draw el...
The curve $y^2=x^3+a\,x+b$ with $x$, $y$ in the field $\mathbb R$ of reals has infinitely many point. It is continuous (with for some choices of parameters 2 disjoint pieces). It is symmetrical with …
- 146k
3
votes
Accepted
The Generator point and Mod P in ECDSA
The video (at least, where the question links) illustrates the Baby-step/Giant-step Discrete Logarithm method in the multiplicative group modulo $p$, for prime $p$. That is the set $\{1,2,\ldots,p-2,p …
- 146k
2
votes
Implementation of ECC over binary field
Q1: generating a random irreducible binary polynomial
Yes, the best known way to generate a random irreducible binary polynomial of a given degree $p$ is to randomly generate a binary polynomial of d …
- 146k
2
votes
Accepted
How to know if a public key has been created based on the ECDSA algorithm?
to create a valid identity, a user must generate an ECDSA public key and then send it to the network administrator for validation
That's under-specified, lacking:
The Elliptic Curve used. Common on …
- 146k
5
votes
Modulo p in Elliptic Curve Cryptography
To carry out Elliptic Curve Cryptography between parties, are all elliptic curve equations considered to be in the form $\bmod p$?
Yes for secp256k1 when it comes to point coordinates, but not for e …
- 146k