Author_Institution :
Inf. Sci. & Eng. Coll., Northeastern Univ., Shenyang, China
Abstract :
In the recent research of conic curve cryptology, all rational points over Ring Zn could be expressed as Cn(a, b) = C1 cup C2 cup C3 cup O. By for now, in the addition of conic curves over Zn, all points on the curves are expressed by the form of (x, y) as the determinant condition. Then, the points belonging to C1, C2, C3, O are computed and the results are discussed respectively. As a consequence too much cost is spent during the calculation. In mobile environment, more attention is paid to cut down the signature execution cost. How to make the signature more efficient is thus more important. The paper reconsiders the addition operation on conic curves over ring Zn as to reduce the amount of calculation. In the progress of the proposed addition operation, the value of (x, y) doesnpsilat need to be computed and all points could be expressed by parameter t. As a result, the computational cost is reduced.
Keywords :
cryptography; curve fitting; Ring Zn; Sun Tzu theorem; conic curve cryptology; Computational efficiency; Costs; Educational institutions; Equations; Information science; Information security; Public key; Public key cryptography; Sun; Zinc; Addition Operation; Conic Curve; Public Key Cryptology; Sun Tzu Theorem;