DefinePK

Abstract

Ensuring robust database security presents numerous challenges, necessitating a meticulously designed encryption model. Conventional single-key encryption systems like AES (Advanced Encryption Standard) and RSA (Rivest-Shamir-Adleman) are effective but frequently lack the ability to offer detailed protection and finely manage security at a granular level. These systems typically encrypt data at the file or table level, leaving individual cells vulnerable to unauthorized access once the primary key is compromised. To overcome these challenges, we suggest an Independent Field Encryption (IFE) approach. Our method encrypts databases at the cell level, offering a highly granular security mechanism where each cell is encrypted using a unique key. Leveraging the principles of modular arithmetic and Fermat’s Little Theorem for modular reduction, IFE provides superior security by minimizing the risk of data breaches through cell-specific encryption. This approach differs from industry standards by ensuring that the impact remains isolated and minimal even if one encryption key is compromised. The security strength of our proposed technique is analogous to the difficulty of reducing a high modular exponent, ensuring robust protection against cryptographic attacks. Moreover, our algorithm operates efficiently in logarithmic time, ensuring scalability and maintaining ciphertext size without enlargement. This innovative approach balances robust protection with computational efficiency, setting a new standard for database security by addressing the shortcomings of current industry-standard algorithms. Through this novel approach, IFE offers a compelling solution for enhancing database security, ensuring that each piece of data is individually protected and secure from a wide range of threats.