All cryptographic tools are fueled up by randomness, mostly low-grade (algorithmic) randomness, which was the order of the day for decades. High-quality randomness was not readily available. Very recently the crypto-eco system changed. Cryptography became an international 'game' of national survival. Our entire civil order hinges on the integrity of the cryptographic foundation of our communication and digital banking. This foundation is strategically threatened by (i) advanced math, and by (ii) the emergence of quantum computing. Quantum computers are poised to destroy the full range of cryptographic primitives that underlie life in cyberspace. The old guard is responding by devising ever more complex algorithms. It's a strategic drive with unclear prospects. What else is there? There is! A second strategic match for the double threat of "math-attack" and quantum computing is high-quality randomness, richly applied. And the time is right. High-grade randomness is now readily available; Moore's law over the cost of storing and communicating randomness has been in effect -- these cost figures are very appealing and getting more so. What is needed is the simple realization that modern cryptography is due for a new strategic option. The security projected by ever more complex algorithms may not be enough. It would be irresponsible not to deploy the rich-randomness strategic security boost.
When we get down to it, we find many pleasant surprises. Randomness-Rich ciphers turn out to have features and offer capabilities that are totally missing from the old guard.
The BitMint randomness-rich cipher suite of products includes:
A super polyalphabet cipher that encrypts several messages in parallel with steganographic properties.
A cipher based on the fact that a journey on a map can be described either by its stepping stones, or by the pathways between these stones, the translation from one to the other requires possession of the map.
Unleashing the power of raw transposition where n items may be ordered in n! ways.
An non-algorithmic alternative to Diffie-Hellman and RSA, allowing two online strangers to establish a private communication channel.
Quantum Algorithms for Optimization and Polynomial Systems Solving over Finite Fields.Quote: "we give quantum algorithms for two fundamental computation problems: solving polynomial systems and optimization over finite fields. The quantum algorithms can solve these problems with any given probability and have complexities polynomial in the size of the input and the condition number of certain polynomial system related to the problem"
Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems quote: "We apply the quantum algorithm to the cryptanalysis of the stream cipher Trivum, the block cipher AES, the hash function SHA-3/Keccak, and the multivariate public key cryptosystems"..