In this paper, an algorithm based fault tolerant (ABFT) scheme for Elliptic Curve Cryptography (ECC) public-key cipher is presented. By adding 2n+1 check sums, the proposed scheme is able to detect and correct up to three errors which may occur during the massive computation process or/and data transmission process for total n2 groups of data. The other advantage of the proposed fault tolerant scheme include: (1). It maintains almost the same throughput when there is no error detected. (2). It does not require additional arithmetic units to create check sums and error detection. (3). It can be easily implemented by software or hardware.