Analysis of Combination Algorithm Data Encryption Standard (DES) and Blum-Blum-Shub (BBS)

Abstract

Abstract Data Encryption Standard (DES) has a weakness in the key that is vulnerable to security threats, but it is quite popular to use because of the fast encryption and decryption process. Combining the DES algorithm with the Pseudo-random number generator Blum-Blum-Shub (BBS) in generating external keys in the encryption and decryption process of messages, produces a unique key and a good level of security. The longer the selected key and seed, the higher the security level of the DES encryption and decryption key. The use of BBS as an external key generator in the DES algorithm does not significantly affect the encryption (key and seed generated is around 0,001 – 0,003 seconds for the 2 – 4 digits experiment) processing time, meanwhile, the time in the decryption process has no effect because the BBS key and seed are no longer subject to feasibility testing or number requirements. The combination of DES and BBS algorithms can increase security in terms of encryption and decryption keys because the random number of DES keys generated by the BBS algorithm is unique and does not burden the user in determining the keys used in the DES algorithm because the keys are generated from the programming language.