Cryptanalysis Algoritma Kunci Publik Inam-Kanwalzahid-Abid dengan Metode Brute-Force Attack

Abstract

The Inam-Kanwal-Zahid-Abid public key cryptography system was developed based on polynomials using key length. This research tested brute-force attacks using short key lengths. The method employed in the study aimed to design and analyze cryptanalysis against public keys by implementing the Inam-Kanwal-Zahid-Abid algorithm. The results of this research indicate that the use of sskey length d2 affects the decryption running time of the Inam-Kanwal-Zahid-Abid algorithm. As the value of d2 increases, the velocity of brute-force attacks proportionately extends. The value of N generated by the prime key generator affects the length of the encryption and decryption keys of the Inam-Kanwal-Zahid-Abid algorithm.