Assume that for the th update of the backtracking, filling 's in and through is assign-compatible, as such, we can prove that filling 's in the previous patterns and through is also assign-compatible.

[1]  Nur A. Touba,et al.  Circular BIST with state skipping , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[3]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[4]  Bruno Rouzeyre,et al.  AES-Based BIST: Self-Test, Test Pattern Generation and Signature Analysis , 2008, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008).

[5]  Shigeo Shioda,et al.  Some upper and lower bounds on the coupon collector problem , 2007 .

[6]  Walter Anheier,et al.  On Random Pattern Testability of Cryptographic VLSI Cores , 1999, European Test Workshop 1999 (Cat. No.PR00390).

[7]  Bruno Rouzeyre,et al.  Securing Scan Control in Crypto Chips , 2007, J. Electron. Test..

[8]  Mark Mohammad Tehranipoor,et al.  Securing Scan Design Using Lock and Key Technique , 2005, 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05).

[9]  Peter Hellekalek,et al.  Empirical evidence concerning AES , 2003, TOMC.

[10]  Paul H. Bardell,et al.  Self-Testing of Multichip Logic Modules , 1982, International Test Conference.

[11]  Ramesh Karri,et al.  Secure Scan: A Design-for-Test Architecture for Crypto Chips , 2006, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[13]  B. Koenemann,et al.  Built-in logic block observation techniques , 1979 .