Kriptanalisis Algoritma Public Key Paillier Sheme 3 Menggunakan Algoritma Kraitchik

Abstract

The Paillier Scheme 3 algorithm is a variant of public key encryption with additive homomorphic properties, designed for efficient decryption. Despite its complex mathematical foundation, this algorithm still requires testing against potential cryptanalysis attacks. This study aims to analyze the vulnerability of the Paillier Scheme 3 algorithm to public key factorization attacks using the Kraitchik Algorithm. The research includes the generation of public and private keys, plaintext encryption, ciphertext decryption, and cryptanalysis through modulus factorization. The algorithm’s effectiveness is measured based on execution time and the success in retrieving the private key. Results show that the Kraitchik Algorithm is capable of breaking the private key of Paillier Scheme 3 for certain key sizes. Additionally, an increase in key length and plaintext document size corresponds to longer encryption and decryption times.