Is-Isn't-Doesn't

GEE:

US Patent 12,047,487 Issued Jul 23, 2024

• is a novel idea to exponentially increase data encryption security--e.g. AES 128 becomes AES 1024. The number of permutations for a brute force attack on AES 128 is 340282366920938463463374607431768211456 or a 3 followed by 38 zeros (3.4028 E+38)--quite a big number. But, with the rise of quantum computing and algorithms like Shor's, there is growing concern over cracking go-to AES and RSA encryption. The government has already deemed that RSA will be End-of-Life by 2030 and 256 bit keys required for AES. It's a vicious cycle of advances in computing power requiring new safeguards to be implemented.

But, what if the number of permutations was so high, that it could never be reached? That's the GEE innovation. It turbocharges encryption algorithms and exponentially raises the number of permutations. AES 128 has 3.4028 E+38 permutations; GEE AES 1024 has 1.7976 E+308 permutations--yes 308 zeros! Standard AES 256 has 1.1579 E+77 permutations; GEE AES 2048 has 3.2317 E+616 permutations--616 zeros;

• uses today's standard encryption algorithms, without modification;

• supports all key-based asymmetric or symmetric encryption algorithms;

• supports all encryption/decryption parameters;

• allows concurrent use of up to 8 different ciphers, padding, and key sizes for each data encryption;

• speeds up symmetric encryption--3X Faster; 

• allows asymmetric encryption to have an 8X Larger max message size.

GEE Isn't :

• a new encryption algorithm;

• a modification to a current encryption algorithm;

• a one-time pad scheme; or

• cascade encryption.

GEE Doesn't:

• segment, organize, augment, modify, format, and/or change portions of input data.