Suitability of Algorithms
Hypothesis Quantum resistant cryptography algorithms can be as secure and fast as current RSA and Diffie-Hellman based algorithms. This will result in an economical transition once new standards are set by the appropriate governing bodies. Research Approach Research on this subject will be primarily conducted using quantitative data collected from a variety of algorithms. This … Continue reading Suitability of Algorithms