Skripsi
IMPLEMENTASI ALGORITMA ENKRIPSI PADA KOMPUTER KUANTUM
With the computing speed possessed by quantum computers, the security of encryption on classical computers is threatened, especially the security of the RSA encryption algorithm, because it is predicted that its security will be threatened by the Shor factorization algorithm, which can be run on quantum computers. This research aims to validate whether the current specifications of quantum computers mean that the Shor algorithm can really threaten RSA and whether RSA can be implemented on quantum computers safely. The results of the research that has been carried out show that, by using eight qubits on an IBM quantum computer, Shor is still unable to overcome the RSA algorithm with a key size of 2048 bits. Apart from that, when the Shor algorithm factors in the number 15, the average time required by the Shor algorithm in five trials is 0.00132 seconds. On a classical computer with ordinary factoring, the time needed to factor in five trials is 0.000244 seconds. Then, it turns out that RSA can be implemented on quantum computers using the BB84 protocol. From the results of experiments that have been carried out to encrypt and decrypt string-type data, the RSA algorithm, which has been modified with the BB84 protocol, requires an average time of 0.000462 seconds for three experiments.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2407003920 | T148763 | T1487632024 | Central Library (REFERENCES) | Available but not for loan - Not for Loan |
No other version available