from FAHEEM41
a symmetric encryption algorithm
WELCOME TO THE PROJECT
WHICH STARTED WITH A STUDENT
PRACTISING NEW THEORIES
LEARNED IN HIS NEW MATH BOOK
[ It is highly encouraged to share your implementations of the algorithm in other languages (guidelines)
Let TABLE1 = matrix (m, n) <- original text
So TABLE2 = TABLE1.transpose <- encrypted text
& TABLE3 = TABLE2.transpose <- decrypted text
Here TABLE1 == TABLE2 ??? --> TRUE
matrix (m, n), here m & n depends on the PASSWORD
Now,
let x = length of matrix (m, n)
So, here the lowest possible value of m is 1, then highest possible value of n is x Thus, PASSWORD should be less than x, i.e. PASSWORD < x