ECDSA (Elliptic Curve Digest Signature Algorithm)
ANSI X9F1 IEEE P1363.
:
1. (a, b).
n.
2. G ∈ (a, b) n, n G = ∞.
3. d ∈ (1, n).
4. Q = d G.
5. d, - < a, b, G, n,Q >.
:
1. k ∈ (1, n).
2. k G = (, ) r = (mod n).
3. r 0, . r = 0, k.
4. (mod n).
5. s = ((M) + dr) (mod n).
H(M) - .
6. s 0,
(mod n) . s = 0,
k.
(r, s).
:
1. , r s (1, n).
,
.
2. w = (mod n), H(M),
3. = H(M) w (mod n), = rw (mod n)
4. P + Q = (, ), v = (mod n)
- 112
5. , v = r.
13. . , . , , . F F*.
1. Q, R, C .
2. ZN N , N . N .
K , f(x) , K . K. K, K , . ZN f(x).
3. f(x) K .
K , p (p ), f(x) m, . , 20- , . , p m. , , , K , .. x , y K x
|
|