Transition Fault Testability in Bit Parallel Multipliers over GF(2^{m})

This paper presents a C-testable technique for detecting transition faults with 100% fault coverage in the polynomial basis (PB) bit parallel (BP) multiplier circuits over GF(2m). The proposed technique requires only 10 vectors, which is independent of multiplier size, at the cost of 6% (avg.) extra hardware and three control pins. The proposed constant test vectors which are sufficient to detect both the transition and stuck-at faults in the multiplier circuits can be derived directly without any requirement of an ATPG tool. As the GF(2m) multipliers have found critical applications in public key cryptography and need secure internal testing, a built-in self-test (BIST) circuit is proposed for generating test patterns internally. This obviates the need of having three extra pins for the control inputs and also provides public-key security in cryptography. Area and delay of the testable circuit are analyzed using 0.18mum CMOS technology library from UMC

[1]  Stafford E. Tavares,et al.  Architectures for exponentiation in GF(2m) , 1988, IEEE J. Sel. Areas Commun..

[2]  Dhiraj K. Pradhan.  A Theory of Galois Switching Functions , 1978, IEEE Transactions on Computers.

[3]  Irith Pomeranz,et al.  Static compaction for two-pattern test sets , 1995, Proceedings of the Fourth Asian Test Symposium.

[4]  Saman Adham,et al.  Scan-based BIST fault diagnosis , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Thomas Beth,et al.  Arithmetic operations inGF(2m) , 1993, Journal of Cryptology.

[6]  Chien-Ming Wu,et al.  High-Speed, Low-Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2^m) , 2004, IEEE Trans. Computers.

[7]  Sudhakar M. Reddy,et al.  On the detection of delay faults , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[8]  Thomas Beth,et al.  Arithmetic Operations in GF(2 m ). , 1993 .

[9]  Eric Lindbloom,et al.  Transition Fault Simulation , 1987, IEEE Design & Test of Computers.

[10]  Kwang-Ting Cheng.  Transition fault simulation for sequential circuits , 1992, Proceedings International Test Conference 1992.

[11]  Xuemin Chen,et al.  Error-Control Coding for Data Networks , 1999 .

[12]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[13]  M. Anwar Hasan,et al.  Efficient Exponentiation of a Primitive Root in GF(2^m) , 1997, IEEE Trans. Computers.

[14]  Hafizur Rahaman,et al.  Easily testable realization of GRM and ESOP networks for detecting stuck-at and bridging faults , 2004, 17th International Conference on VLSI Design. Proceedings..

[15]  Dhiraj K. Pradhan,et al.  Easily Testable Implementation for Bit Parallel Multipliers in GF (2m) , 2006, 2006 IEEE International High Level Design Validation and Test Workshop.

[16]  Chin-Liang Wang,et al.  Systolic Array Implementation o Euclid's Algorithm for Inversion and Division in GF(2m) , 1998, IEEE Trans. Computers.

[17]  T. Gulliver,et al.  The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis , 1991 .

[18]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Michael S. Hsiao,et al.  Novel ATPG algorithms for transition faults , 2002, Proceedings The Seventh IEEE European Test Workshop.

[20]  Edoardo D. Mastrovito,et al.  VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[21]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[22]  M. Anwar Hasan,et al.  Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.

[23]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[24]  Hafizur Rahaman,et al.  Testable design of GRM network with EXOR-tree for detecting stuck-at and bridging faults , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).