I have trouble understanding steps for Key set generation mentioned in an article titled as "An optimized encryption technique using an arbitrary matrix with probabilistic encryption". The steps are:
- Consider the sequence for 0 to n-1 values for a source text of size n = pow (p, p) characters.
- Convert each element of the sequence into a form with base p.
- Represent the values of step 2 in a matrix form A of order n x p.
- Subtract 1 from each element of A.
- Consider a random matrix B of size p x p.
- Multiply the matrix A with B to generate a result matrix R.
- Substitute all positive integers of R with +1, negative integers to -1 and zero by 0 using a substitute function.
- Increment each element of R by 1.
- Convert each row of R, from the base p to decimal to generate the key sequence set.
I can't understand how this works. Can you explain these steps with an example? Or pseudocode?