| CPC H04L 9/0637 (2013.01) [H04L 9/0656 (2013.01)] | 22 Claims |

|
1. A Galois Extension Field-based block encryption process, comprising:
synchronizing a random number generator (RNG), wherein the RNG is a pseudo-random number generator (PRNG);
forming an output from the PRNG into a key matrix, wherein the key matrix is formatted as an invertible square matrix;
applying a Galois Extension Field (GEF) operation to the key matrix, to map elements of the key matrix from a Galois field space order GF(pk), where p is a prime number, to a closed subset in a higher-order Galois extension field space;
mapping plaintext to a plaintext matrix;
applying the GEF operation to the plaintext matrix, to map elements of the plaintext matrix from the order GF(pk) to the higher-order Galois extension field space;
combining the plaintext matrix and the key matrix using extension field matrix multiplication, to produce a vector of ciphertext in the higher-order Galois extension field space;
reducing the vector of ciphertext from the higher-order Galois extension field space to a reduced vector of ciphertext in the order GF(pk) using an inverse of the GEF operation; and
during the reducing, applying a ceiling operation to bijectively map elements in the reduced vector of ciphertext to a closed subset in the order GF(pk).
|