Algorithm introduction:
The present N * n matrix M, N and P, P = m * n. If the row of M (or N) is zero, N (or M) is calculated from p and m (or p and n), and the alternative problem, especially the rank of M (or N), N (or M) more well.
From the above questions, assuming Tom and Bob communicate with each other, now do the following conventions:
1. Before formal communication, two agreed one condition singular matrix M.
2. Tom and Bob each selected a random matrix of N * N as their private key, set TOM as A, Bob is B.
3. The TOM calculation matrix PA = a * m is then used as his public key, and the Bob calculation matrix PB = m * b is used as his public key.
4. When the TOM sends a message to the BOB, calculate the encryption matrix k = a * Pb. When the message is encrypted with the message, the BOB is sent to the BOB terminal. After the BOB receives the message, the decryption matrix K '= PA * B is calculated, and the above algebraic relationship is It can be seen that K = k ', which is encrypted and decrypted as the reverse process, and can refer to the symmetric encryption standard AES.
5. When Bob sends a message to Tom, calculate the decryption matrix K = PA * B, encrypt. Tom Receives the message and calculates the decryption matrix K = a * Pb, the principle is the same.
I am very sorry, the above algorithm has been demonstrated, and the fatal mistakes have been discovered!
