Group Theoretic Cryptography

 

Our methods are based on Group Theoretic Cryptography (GTC), an area studied for more than 40 years, that has been used to develop an algorithmically efficient, one-way function called E-Multiplication.

The algorithm is computationally hard to reverse yet rapidly computable, which enables it to run on devices with constrained resources. It is the foundation for several cryptographic constructions including a public key agreement (asymmetric) and secret key (symmetric) methods, a digital signature method, a cryptographic hash method, and a pseudo-random number generator.

Unlike classic cryptographic protocols such as RSA and ECC, the security of GTC is not susceptible to any known quantum computing attack. Delivering 100× better performance than other commercially available protocols, GTC supports a wide range of cryptographic functions including authentication, data protection, encryption/decryption, and additional security:

  • Authentication — Enables validation between devices to confirm identity. Message authentication codes and digital signatures can be used to ensure data integrity against modification or forging. This cryptographic function is used in anti-counterfeiting applications.
  • Data Protection — Secures the entire data stream that is being carried, including the commands and information.
  • Encryption and Decryption — A type of data protection that employs the process of obscuring information to make it unreadable without special knowledge. Encrypting the data, with a key management protocol, allows trusted users to read the data.
  • Additional Security — Key agreement protocols, hash functions, and stream ciphers.

GTC is used in products and solutions developed by SecureRF and is available as a Security Tool Kit for several microcontrollers and as an IP core for FPGAs and ASICs. You can learn more about SecureRF’s cryptographic methods by reading our white papers and technical presentations.