Digital signatures on MBXI

Returning to MBXI, we notice that [x], the reformulated encryption key, is able to perform the encryption:

C ≡ Mx (mod p) 

[x] results in the inverse of [y], the decryption key, in the following function:

C^y ≡ M (mod p)

In mathematical language, the encryption equation is as follows:

{[Ka^b+eB] (mod p) * x ≡ 1 (mod p-1)

This results in the inverse of the decryption equation, [y]:

y ≡ {[Kb^a+eB] (mod p)}

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:

Reduce [3009*x == 1, y, Modulus -> p - 1]
y == 4955

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...