Digital signatures on MBXI
Returning to MBXI, we notice that [x], the reformulated encryption key, is able to perform the encryption:
[x] results in the inverse of [y], the decryption key, in the following function:
In mathematical language, the encryption equation looks as follows:
This result is the inverse of the decryption equation, [y]:
Let’s perform a test with numbers to understand it better:
- x = 3009
- y = 4955
If we input x = 3009 in the inverse function (mod p-1), we can find the result [y] using Mathematica:
That means if Bob sends a message using MBXI, he will share a [secret key] type with Alice.
Another problem arises: how is it possible to avoid a MiM attack in a symmetric algorithm?
As you can see, MBXI has more characteristics of an asymmetric algorithm than a symmetric algorithm, so let’s analyze the algorithms of the digital signature for MBXI.
As we have learned...
