defend supply chain shows that the blocking version of this breed of networks could be easily broken by a SAT attack within few iterations [@kamali2019full; @azar2019coma].

Being a blocking or a non-blocking CSTN depends on the number of stages in CSTN. Since no two paths in an RRB are allowed to use the same link to form a connection, for a specific number of RRB columns, only a limited number of permutations is feasible. However, adding extra stages could transform a blocking CSTN into a strictly non-blocking CSTN. Using a strictly non-blocking CSTN not only improves the randomization of propagated messages through the CSTN, but also improves the resiliency of these networks against possible SAT attacks for extraction of a TRN used as the key for a CSTN-RCSTN cipher. A non-blocking logarithmic network could be represented using $LOG_{n, m, p}$, where $n$ is the number of inlets/outlets, $m$ is the number of extra stages, and $p$ indicates the number of copies *vertically cascaded* [@shyy1991log].

According to [@shyy1991log], to have a strictly non-blocking CSTN for an arbitrary $n$, the smallest feasible values of $p$ and $m$ impose very large area/power overhead. For instance, for $n=64$, the smallest feasible values, which make 