Cryptography Random Algorythm (CRA) untuk Mengantisipasi Serangan dengan Brute Force

Abstract

One type of algorithm that is often used to secure data is the asymmetric algorithm, where this algorithm is widely used by business entities and governments to secure data. We know that this algorithm relies on two keys as its security, namely private key and public keys. Even though this algorithm is the main choice for data security, this algorithm has problems that are increasingly getting bigger, namely the increasing size of the public key. In general, this asymmetric algorithm has two keys as its security, but "is it possible if the concept of this asymmetric algorithm has two algorithms that are exchanged between the sender and recipient of the message as security?". In this research, the algorithm created will be randomized every time a transaction or message is exchanged. This is done to prevent cryptanalysts from using brute force methods on the algorithm. The algorithm in this research is named Cryptography Random Algorithm (CRA). With this research, the results are what cryptanalysts need to try to do brute force estimated 3x102169 years, assuming one trial in nanoseconds.