Secure deterministic encryption key generator system and method

TLDR: In this article, an encryption key generator (100) is disclosed which is highly resistant to cryptographic analysis or brute force attacks, and which accommodates the destruction of an encrypted key after each use by providing for the recreation of the key without need of key directories or other encryption key storage processes.

Abstract: An encryption key generator (100) is disclosed which is highly resistant to cryptographic analysis or brute force attacks, and which accommodates the destruction of an encryption key after each use by providing for the recreation of the key without need of key directories or other encryption key storage processes. A constant value (51) and a secret E-Key Seed (50) are applied as an input to a bit-shuffling algorithm (52) to provide a first many-to-few bit mapping and produce a first pseudo-random number. The first pseudo-random number in turn is applied as an input to a secure one-way hash algorithm (53) to provide a second many-to-few bit mapping and produce a second pseudo-random number or message digest that may be truncated to a desired bit length to serve as a non-predictable but deterministic encryption key (55). Same constant value (51) and E-Key Seed (50) inputs to the key generator (100) provide the same message digest and hence the same key (55).