Design and implementation of a dynamic re-encryption system based on the priority scheduling

Abstract

In this paper, a dynamic re-encryption system is proposed that prevents data from being decrypted and minimizes damage even if the encryption key is exposed by changing the encryption key according to the schedule and re-encrypting the stored data. We show that the proposed dynamic re-encryption system can reduce the probability from 100 to 0% that the RSA-512 ciphertext and the RSA-768 ciphertext are decrypted by the mathematical attack method over a given period. The proposed system can reduce the re-encryption time by 70% by implementing parallel processing with dynamic multithreading that checks the CPU usage of the server and adjust the number of threads actively. And the system ensures system reliability by preventing overflow and system interruption from occurring while maintaining server utilization at an average of 78%.