Septafiansyah Dwi Putra, Sarwono Sutikno, A. Sumarudin, Nelmiawati, Imam Asrowardi, Antoni Haikal
The integration of symmetric encryption algorithms such as the Advanced Encryption Standard (AES) into Partial Homomorphic Encryption (PHE) frameworks remains a challenging task, particularly due to the computational incompatibility of the AES substitution box (S-Box) with additive-only schemes like Paillier. The traditional S-Box, based on inversion in GF(28) and affine transformation, requires operations that cannot be directly executed in Paillier PHE, while a lookup table (LUT) approach incurs substantial memory overhead-especially in Internet of Things (IoT) contexts with constrained resources. This study proposes and evaluates a degree-4 polynomial-based approximation of the AES S-Box, designed to be compatible with the additive homomorphic operations supported by Paillier. The proposed method aims to reduce memory requirements and computation complexity while enabling efficient non-linear substitution in the encrypted domain. Results provide insights into the trade-offs between security and efficiency for implementing AES under Paillier PHE constraints, offering a potential pathway for secure and resource-efficient cryptography in IoT environments. © 2025 IEEE.
Politeknik Negeri Lampung, Department of Information Technology, Bandar Lampung, Indonesia; Institut Teknologi Sumatera, Faculty of Industrial Technology, Lampung Selatan, Indonesia; Politeknik Negeri Batam, Department of Informatics Engineering, Batam, Indonesia