Pure Human Randomization, or PHR, is an innovative and patented post quantum computing secured, symmetrical, polymorphic non-mathematical encryption method. Its key strength (minimum 1 million bit key size) is truly chaotic and replaces the structuring and use of a pseudo-random calculative hash function. PHR cannot be cracked or brute forced by any known method(s).
Other encryption algorithms have a bit overhead of between 300-700% when encrypting small amounts of information. PHR on the other hand uses an unparalleled, non dictionary compression ratio operational technique which has a bit overhead of 5-7%. Because of this, we are able of encrypt entire columns of a database (up to 500 characters) into one 2D barcode. A process referred to as MDLE – Micro Database Less Encapsulation.
The Encryption Process:
We use a state of the art compression algorithm to optimize the original content for efficient performance of the encryption engine.
Salting the original content with white noise and PHR (Pure Human Randomness).
The encryption engine creates both shuffle and move commands using a unique modifier, which is core based on the PHR and white noise engine and performs the first layer of modification to the original content.
XOR function on the PHR output results in a Random Oriented Enhanced Encryption (ROEE). When combined with a time set of instructions and a computational temporary set of instructions, the result is a real one time pad (OTP). This appears as a polymorphic function where the output (encrypted content) is variable.
Reconstructing a file level on a multiple N-dimension code manipulation with zero use of a calculative algorithm, also referred to as a secondary phase of salting, results in superior protection against Rainbow Crack, Dictionary Attack, Cryptanalysis, etc.
- Key Strength – 1 million bit or more
- Performance 400% faster compared to AES.
- MPU use – Mathematical Process Unit in CPU use 3% – 7% only.
- Overhead of the file from original 5% +/- (original+5%) +/-