Algorithm 1 S-Box generation.

Input:  $X_n,\rho ,I$ Output: S-Box     1:  while (i < 300) do   2:     iterate PWLCM with $x_n$   3:     set $x_{n+1}=x_n$   4:     $X⟵Floor(x\times 256)$   5:     if $X\notin S-Box$ then   6:         Sub-Box $⟵X$   7:         = $i=i+1$   8:     else   9:         iterate PWLCM with $x_n$ 10:     end if 11:     Optimization 12: end while