of SAT, it could find only 7 DIPs. However, we expect that for an *OMEGA*-based CSTN with size 512, SAT needs more than 25 DIPs to find TRN.

[@ l \*9c @]{} CSTN Size ($n$) & 4 & 8 & 16 & 32 & 64 & 128 & 256 & 512\
SAT Iterations & 6 & 7 & 8 & 12 & 14 & 24 & 25 & TO\
SAT Execution Time $_{(Seconds)}$ & 0.01& 0.03 & 0.2 & 0.8 & 5.9 & 130.5 & 1136.2 & TO\
*TO: Timeout = $2\times10^6$ seconds*

Table \[nonblk\_sat\] illustrates that using near non-blocking CSTN considerably enhances the resiliency of this approach against the SAT attack. As shown in Table \[nonblk\_sat\], for a near non-blocking CSTN with a size of 64 ($LOG_{64, 4, 1}$), the SAT is not able to find the TRN after $2\times10^6$ seconds. Even after $2\times10^6$ seconds execution of SAT, it cannot find more than 5 DIPs. However, based on the SAT iterations for $LOG_{32, 3, 1}$, we expect that for a close to non-blocking CSTN with size 64, more than 32 DIPs are required to extract CSTN configuration.

[@ l \*9c @]{} CSTN Size ($n$) & 4 & 8 & 