How secure would the following logarithmic encryption algorithm be when tested under the same conditions as high end encryption algorithms (AES, RSA etc...).
Note: For smaller text the text will be padded to form a minimum length of 1024 bits.
For encryption:
1. Generate random numbers as same length as the message. R = [5, 13]
2. Turn message characters into ordinal numbers. M = [97, 98]
3. Encryption algorithm is as follows: M^x = R
; to solve this: x = log(R)/log(M)
For decryption:
1. To find the original ordinal number again: M = x_sqrt(R, x)
; x_sqrt
is to find the nth_root of a number, where R
is the the radicand and x
is index.
Example:
R = [13]
M = [98]
Encryption:
M^x = R
: 98^x = 13
: x = log(13) / log(98)
: x = 0.559425856
Decryption:
M = x_sqrt(R, x)
: M = x_sqrt(13, 0.559425856)
: M = 98