A leading security provider needs to command a fast, efficient, and intractable encryption mechanism. The industry standards today, are either not fast enough, or not sufficiently efficient, or they come with intractability that is eroding as we speak.

A new generation of ciphersystems is rising to replace the current crop, and Daniel™ is a leading member of this looming wave.

What's so special about Daniel™?

Daniel™ breaks away from the prevailing practice of key-plaintext complexity algorithms. RSA, DES, AES, ECC -- today's leading choices -- rely on a complicated-by-design process that combines the key bits with the plaintext bits. The problem with this approach is what anyone who tried to solve an elegant riddle knows: what seems complex at the onset, has a simple solution that surfaces after some thinking. If you solve a riddle you readily announce it. But if you simplify the underlying complexity of, say, AES, then you are likely to remain very secretive about this feat. Because this mathematical insight allows you to violate the security, the privacy and the integrity of everyone who uses AES (without raising suspicion).

Daniel™ is immunized to this 'clever adversary' weakness because Daniel encryption is based on the network complexity of its key bits, not on an assumed complexity of processing the key with the plaintext. And the next advantage of this old-new paradigm is that the key can grow at will, without computational penalty.

Why old-new?

In 1917 Gilbert Vernam patented what is known today as One-Time-Pad. It is an unbreakable cipher that like Daniel™ does not use a complex algorithm for key-plaintext processing. And hence in the ensuing 89 years no one cracked the Vernam cipher. Similarly Daniel™ is ultimately resilient against smart cryptanalysts. And while Vernam cipher is considered impractical because it requires a very large key, Daniel™ can easily employ a large key (no computational penalty!), but it does not have to. Daniel™ provides sliding security depending on its key size.

Daniel™ is structurally fit for both hardware and software applications. It requires very little processing power, and hence it is very well suited for smart cards, and RFID.

Daniel™ offers encryption layering. Accordingly, an adversary would decrypt the upper layer, and remain unaware that the ciphertext may be re-decrypted to extract a deeper message. Layering can be used to fingerprint data (digital rights management), and to economize organizational communication: a single letter would be decrypted at different levels (extracting deeper or shallower content) depending on the hierarchy status of the reader.

Daniel™ may be processed with an increased size ciphertext (larger than the plaintext). This attribute allows for one-to-many encryption, and many-to-one decryption, which in turn serves as a basis for a-cyclical psuedo random number generator (PRNG), as well as a traffic masking procedure (WhiteShadow).