| 摘要 |
<p>PROBLEM TO BE SOLVED: To improve safety rather than regarding a discrete logarithm problem on a finite field as the base of safety. SOLUTION: Different elements G1 and G2 are selected at random disclosed from a subgroup Gp of element number (q) in a rational point group E(F(p<n> )) on an elliptic curve E defined on F(p<n> ) of a finite field F(p<n> ) ((p): prime and (n): natural number), a testifier selects different two from Z/qZ at random as secret keys (s1 ) and (s2 ), finds a public key V=[-s1 ]G1 +[-s2 ]G2 as an element on the E, selects (r1 ) and (r2 ) at random from Z/qZ, find an element X=[r1 ]G1 +[r2i ]G2 as an element on the E and sends X to a verifier, the verifier selects a challenge (e) at random from Z/qZ and sends it to the testifier, the testifier calculates responses y1 =r1 +e.s1 mod q and y2 =r1 +e.s2 mod q and sends them to the verifier, the verifier finds X'=[y1 ]G1 +[y2i ]G2 +[e]V as an element on E and when X'=X is satisfied, it is regarded as legal one.</p> |
