Research Of Transaction Signature Algorithm Based On Elliptic Curve

There are a lot of significant documents flowing in the platform offered by the electronic government, so it is essential to keep the information confidential. In the government, the strict regulation of affairs is called for. In case of acting against the regulation, the serious effect would be made. As we know, usual digital signature just offers sender authentication, however it cannot guarantee the correctness of the transaction processing.In this paper, we have discussed an algorithm of transaction signature. This algorithm can verify the correctness of the whole procedure. The security of the algorithm is based on the complexity of solving elliptic curve discrete logarithm problem. We implement the algorithm of transaction signature, base on Elliptic Curve Cryptography. Producing a digital signature and verifying this signature constitute the transaction signature protocol.About the computations of the elliptic curves on finite fields of characteristic 2 or a large prime number p, there are a lot profound studies already. In this paper, we concentrate on computations on the finite field of characteristic 3, and implement it on polynomial base. To illustrate this algorithm, we havediscussed several concrete examples, the elliptic curves on finite fields F32, F33 , F34. In those examples,we first analyze the structure of cyclic groups and the basic calculation:; in details, which consist of the points of elliptic curves, and then establish the construction of the digital signature.There are two basic types of managing one transaction. One is called "series connection", in which each department completely deal with the transaction in sequence. The other is called "parallel connection", in which every department except the starting department and the ending department synchronously transact it.Since the Tate pairing on the elliptic curve is doubly linear, we utilize the property to verify the digital signature. About the calculations of Tate pairing, we adopt Miller algorithm, and implement it on the finite field of characteristic 3. Miller's algorithm is basically the usual 'double and add' algorithm for elliptic curve point multiplication combined with an evaluation of certain intermediate functions which are the straight lines used in the addition process.To apply the transaction signature protocol to check the transaction processing in the electronic government, we propose a design of distributed transaction security platform. According to thecharacteristic of transaction and existed problem related with safety, the platform will provide a secure and credible environment for the distributed electronic transaction. The designed platform conform with the distributed component standard, The Common Object Request Broker Architecture. The IDL definition and system structure is given on the following paper.