A New Approach

The UberCrypt Framework (UCF) is part ‘happy accident’ and part ’empirically engineered’.

In late 2010, while developing some technology for NFC (Near Field Communications), some math in that technology suggested itself as potentially useful as a compression algorithm. In exploring that expression of the math for compression – it also suggested itself as a potential encryption algorithm. So, from late 2010 through early 2011, we explored two core notions that have remained integral to the UCF: using 3D geometry as “leverage” in a one-way trap door method for pseudo-random prime number generation, and using the Mantissa of the Irrational Roots of Primes (we call these MIRPs) in a structure that yields high-quality key streams. These two tightly-coupled elements form a robust, extensible and dynamic framework for performing a wide range of cryptologic functions.

By Q2 of 2011, we had working proof of concept software that embodied a working stream cipher. By Q3 we had a mature and stable implementation. Since then, with ongoing empirically-based research into the behaviors of the mathematics, we have continued to refine and expand the original model and software (over 100 builds running on Windows, OSX and Linux). The UCF now includes an experimental block cipher in addition to the primary stream cipher. It includes a refined ‘MIRP Field’ structure that is optimized to balance speed, strength, security and simplicity. It has demonstrated its ability to function with non-standard geometric forms as well as the standard geometric form. It has demonstrated, millions of times, that the cipher speed is constant and unrelated to the internal strength of any given encryption. Many thousands of NIST STS tests on gigabytes of key streams have consistently demonstrate a 99.937% passing score proving the quality of randomness in the resulting key streams. The reference software was intentionally architected from the ground up to fully expose and log virtually every calculation for every encryption/decryption/key creation. So, we have over 15 million tests logged so far that testify to the speed, randomness and other performances.

In addition, with feedback we’ve received from members of industry, government and other national standards bodies, academia and more – we have strengthened the system. This effort culminated in October of 2014 with the publishing of our first research paper on the UCF. The UCF has also been awarded two patents (8767954 & 9118481) by the US Patent and Trademark Office.

If you are a crypto-expert in industry, government or academia – we eagerly solicit your careful review. Our primary interest is in determining if the UCF has any remaining fatal weaknesses. We are sure that some small weaknesses will remain, but are equally confident that these are easily remediated. The system is robust and dynamic so all weaknesses found to date were easy┬áto remediate.

If you are a Value Added Reseller, Integrator, Managed Services Provider, Independent Software Vendor, member of the Standards Community, member of Government or the Intelligence Community… we have tools you can use to quickly and easily integrate the UCF into your own tools and environments in order to secure your data.

Finally, the UCF gives rise to new kinds of applications and new functionality to existing applications. So, we are also launching KeyRepository.com which will facilitate, in new ways, securing your encryption keys (be they for the UCF or any other encryption algorithm). You will also see some of the UCF foundations used in other exciting technologies that may only be tangential to cryptography.

The UCF: Indefinite Possibilities!

Need More Information?

To request a briefing, please complete the following request form.

Someone will respond within one business day.

Thank you for your inquiry!


Your Name (required)

Your Company(required)

Your Title(required)

Website (required)

Your Email (required)

Phone (required)


Your Message