I have an algorithm that requires a set of keys to encrypt a text (image of size N x N). It is an image encryption algorithm for a project. The key can be thought of as a tuple
$x_0, \lambda, d, i, j, DF, U$
- $0 < x_0 < 1$;
- $3.57 \leq \lambda \leq 4$,
- $15 \leq d \leq \infty, 1 \leq i \leq \infty, 1\leq j \leq \infty$
- $1E8 < DF < 1E9$
- $U$ is any random $4 \times 4$ matrix.
If this is my parameter set, how can I calculate the key-space of the algorithm?