Galois extension field-based block cipher
View Patent ↗Various examples are provided related to a block cipher adaptation of the Galois Extension Fields (GEF) combination technique. In one example, a GEF-based block encryption includes forming an output from a PRNG into a key matrix, where the key matrix is formatted as an invertible square matrix; applying a GEF operation to the key matrix to map elements to a closed subset in a higher-order GEF space; mapping plaintext to a plaintext matrix; applying a GEF operation to the plaintext matrix to map elements to the higher-order GEF space; combining the plaintext matrix and the key matrix to produce a vector of ciphertext in the higher-order GEF space; reducing the vector to a reduced vector of ciphertext using an inverse of the GEF operation; and during the reducing, applying a ceiling operation to bijectively map elements in the reduced vector to a closed subset. Another example includes GEF-based block decryption.
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(p k ), 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(p k ) 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(p k ) 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(p k ).
2. The encryption process according to claim 1 , wherein the higher-order Galois extension field space is of order GF(p k+1 ).
3. The encryption process according to claim 2 , wherein p is 2 and the process further comprises optimizing subsequent Galois Extension Field computations in a digital computational framework to an odd subset of GF(2 k+1 ).
4. The encryption process according to claim 1 , further comprising partitioning the plaintext to conform to a block size for encryption.
5. The encryption process according to claim 1 , further comprising padding the plaintext to conform to a block size.
6. The encryption process according to claim 1 , further comprising operating the process in Electronic Codebook (ECB) mode.
7. The encryption process according to claim 1 , further comprising operating the process in Cipher Feedback Mode (CFB).
8. The encryption process according to claim 1 , further comprising operating the process in Cipher Block Chain (CBC) mode.
9. The encryption process according to claim 1 , wherein the key matrix is selected as an upper triangular square matrix or a lower triangular square matrix.
10. The encryption process according to claim 9 , wherein the key matrix is (a) alternated, (b) randomly selected between upper and lower triangular matrices between code blocks, or (c) a composition of upper and lower triangular matrices.
11. A Galois Extension Field-based block decryption 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(p k ), where p is a prime number, to a closed subset in a higher-order Galois extension field space;
inverting the key matrix to an inverted key matrix;
extending a vector of ciphertext from the order GF(p k ) to the higher-order Galois extension field space using the GEF operation;
combining the vector of ciphertext and the inverted key matrix using extension field matrix multiplication, to produce a vector of plaintext in the higher-order Galois extension field space; and
reducing the vector of plaintext from the higher-order Galois extension field space to the order GF(p k ) using an inverse GEF operation.
12. The decryption process according to claim 11 , wherein the higher-order Galois extension field space is of order GF(p k+1 ).
13. The decryption process according to claim 12 , wherein p is 2 and the process further comprises optimizing subsequent Galois Extension Field computations in a digital computational framework to an odd subset of GF(2 k+1 ).
14. The decryption process according to claim 13 , comprising, after the reducing, applying a floor operation to bijectively map elements in the vector of plaintext to a closed subset in the order GF(2 k ).
15. The decryption process according to claim 11 , further comprising removing padding from recovered plaintext.
16. The decryption process according to claim 11 , further comprising operating the process in Electronic Codebook (ECB) mode.
17. The decryption process according to claim 11 , further comprising operating the process in Cipher Feedback Mode (CFB).
18. The decryption process according to claim 11 , further comprising operating the process in Cipher Block Chain (CBC) mode.
19. The decryption process according to claim 11 , wherein the key matrix is selected as an upper triangular square matrix or a lower triangular square matrix.
20. The decryption process according to claim 19 , wherein the key matrix is (a) alternated, (b) randomly selected between upper and lower triangular matrices between code blocks, or (c) a composition of upper and lower triangular matrices.
21. A Galois Extension Field-based block encryption system, comprising:
at least one processing device; and
at least one memory device that stores computer-readable instructions thereon that, when executed by the at least one processing device, direct the at least one processing device to:
synchronize a random number generator (RNG), wherein the RNG is a pseudo-random number generator (PRNG);
form an output from the PRNG into a key matrix, wherein the key matrix is formatted as an invertible square matrix;
apply a Galois Extension Field (GEF) operation to the key matrix, to map elements of the key matrix from a Galois field space order GF(p k ), where p is a prime number, to a closed subset in a higher-order Galois extension field space;
map plaintext to a plaintext matrix;
apply a GEF operation to the plaintext matrix, to map elements of the plaintext matrix from the order GF(p k ) to the higher-order Galois extension field space;
combine 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;
reduce the vector of ciphertext from the higher-order Galois extension field space to a reduced vector of ciphertext in the order GF(p k ) using an inverse of the GEF operation; and
during the reduction of the vector of ciphertext, apply a ceiling operation to bijectively map elements in the reduced vector of ciphertext to a closed subset in the order GF(p k ).
22. A Galois Extension Field-based block decryption system, comprising:
at least one processing device; and
at least one memory device that stores computer-readable instructions thereon that, when executed by the at least one processing device, direct the at least one processing device to:
synchronize a random number generator (RNG), wherein the RNG is a pseudo-random number generator (PRNG);
form an output from the PRNG into a key matrix, wherein the key matrix is formatted as an invertible square matrix;
apply a Galois Extension Field (GEF) operation to the key matrix, to map elements of the key matrix from a Galois field space order GF(p k ), where p is a prime number, to a closed subset in a higher-order Galois extension field space;
invert the key matrix to an inverted key matrix;
extend a vector of ciphertext from the order GF(p k ) to the higher-order Galois extension field space using the GEF operation;
combine the vector of ciphertext and the inverted key matrix using extension field matrix multiplication, to produce a vector of plaintext in the higher-order Galois extension field space; and
reduce the vector of plaintext from the higher-order Galois extension field space to the order GF(p k ) using an inverse GEF operation.