[1]BONEH D, DEMILLO R A, LIPTON R J. On the importance of checking cryptographic protocols for faults [C]// EUROCRYPT'97: Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques, LNCS 1223. Berlin: Springer-Verlag, 1997: 37-51.[2]BIEHL I, MEYER B, MLLER V. Differential fault attacks on elliptic curve cryptosystems [C]// CRYPTO'00: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology, LNCS 1880. Berlin: Springer-Verlag, 2000: 131-146.[3]VANSTONE S A, BROWN D R. Method and apparatus for performing elliptic curve arithmetic: USA, 7418099 [P]. 2008-08-26.[4]BLMER J, OTTO M, SEIFERT J-P. Sign change fault attacks on elliptic curve cryptosystems [C]// FDTC 2006: Proceedings of the Third International Workshop on Fault Diagnosis and Tolerance in Cryptography, LNCS 4236. Berlin: Springer-Verlag, 2006: 36-52.[5]JOYE M. Fault-resistant calculcations on elliptic curves: European Patent Application, EP2228716 [P]. 2010-09-15.[6]GAUBATZ G, SAVAS E, SUNAR B. Sequential circuit design for embedded cryptographic applications resilient to adversarial faults [J]. IEEE Transactions on Computers, 2008, 57(1): 126-138.[7]ZHU WEIWEI, YAN YINGJIAN, LIU KAI. State machine skip fault attack on elliptic curve cryptosystems [C]// ISAI 2010: 2010 International Conference on Information Security and Artificial Intelligence. Chengdu, China: [s.n.], 2010: 159-161.[8]HADJICOSTIS C N. Finite-state machine embeddings for nonconcurrent error detection and identification [J]. IEEE Transactions on Automatic Control, 2005, 50(2): 142-153.[9]HADJICOSTIS C N. Nonconcurrent error detection and correction in fault-tolerant linear finite-state machines [J]. IEEE Transactions on Automatic Control, 2003, 48(12): 2133-2140.[10]赵琦,刘荣科.编码理论[M].北京:航空航天大学出版,2009:10-12.