In ensuring the operation of an IT system, it is essential to maintain the data’s confidentiality and integrity, which is based on some encryption processes. Encryption procedures are based on algorithms, the theory of which is given by cryptography. Due to their complexity, they are often hardly understandable not only to an average person but also to the majority of professionals who are familiar with IT. The algorithms used are not eternal; various designs or implementation errors or even performance gains from computer hardware improvements make one time high achieving algorithms obsolete and easily hackable. Strong algorithms can be circumvented in alternative ways, the necessary software and hardware infrastructure can already be built from personal computing devices. I tested its effectiveness on two different password databases: with the success of hacking university passwords, I prove that it is possible to circumvent strong algorithms with simple methods. Modern encryption algorithms have a relatively long life cycle and they become obsolete slowly. The construction of the quantum computer creates a new situation, which requires a number of procedures to be eliminated and its parameters to be modified or protected by additional methods. As it is an impossible task to modernise the encryption algorithms of all IT systems operating today, preparations must be started as soon as possible so that the new situation can be handled, at least for critical systems. In my article, I would like to draw attention to the weaknesses of encryption methods, present a possible method of circumventing the cryptographic methods currently in use, demonstrate the operation of a quantum computer and some algorithms relevant to the topic.
Extracting high fidelity quantum computer hardware from random systems