Shelton, CT – SecureRF unveils the world’s first linear-in-time algorithm – Algebraic Eraser (AE) that delivers significant security process improvements for devices often found in the internet of things (IoT).
Designed specifically to address privacy and security needs of very low-resource devices, AE can be leveraged within any application currently using FPGAs, ASICs and other low power platforms (including ARM Cortex-M processors) to deliver public key authentication and security – making AE a logical fit for a wide range of industries including military/defense, consumer products, medical devices, building/home automation, automotive, credentialing and mobile payments.
Through breakthrough algorithms, AE’s greater efficiency over commercially available solutions is highlighted by its significantly shortened run-time and a dramatic reduction in the amount of energy consumed. In fact, when benchmarked against Elliptic Curve Cryptography (ECC) across multiple platforms, the Algebraic Eraser proved to use up to 98% less energy while at the same time delivering a 40x increase in processing speed.
“SecureRF is excited to have the opportunity to demonstrate for developers how our technology can improve security performance in their current projects and open new doors to devices that have presented resource and space challenges,” said SecureRF CEO Louis Parks. “Providing developers a hands-on experience with Algebraic Eraser will bring the speed and power advantages front and center.”
In addition to authentication, AE methods support a wide range of other cryptographic functions including identification, encryption / decryption, HASH functions, and is available via partnerships and licensing arrangements.
About the Algebraic Eraser
The Algebraic Eraser™ cryptographic method delivers ground-breaking performance for low-power, and passive devices. Offering both symmetric (private key or secret key) and asymmetric (public key) cryptography methods to meet a wide array of security and authentication needs, the AE algorithm runs in linear time with respect to the key length, and employs highly non-linear operations in a non-commutative infinite monoid—yielding unprecedented security. SecureRF has been granted U.S. Patent 7,649,999 for its technology invention in the field of cryptography. The technology, described in the patent entitled “Method and apparatus for establishing a key agreement protocol,” provides a system and method for generating a secret key to facilitate secure communications between users via an algorithmically efficient one-way function using a branch of mathematics referred to as braid group theory. The algorithm is computationally hard to reverse while rapidly computable, thus enabling it to run on devices with low computing resources.
For more information on anti‐counterfeiting, cybersecurity, or securing the Internet of Things: