Application of Integer Linear Programming in Elliptic Curve Cryptosystem

The speed of point addition on elliptic curve is critical in elliptic curve application cryptosystem design based on FPGA device.A point addition algorithm suitable for FPGA realization is proposed with comparison and analysis on several different point addition algorithms in different projective coordinates.Integer linear programming algorithm is provided in terms of application restriction of elliptic curve cryptosystem.The algorithm is applied to the elliptic curve point addition and parallel-optimization is carried out at the same time.Experiment results show that the parallel-optimized elliptic curve point addition is 22 percent faster than the original algorithm.