1. A Homomorphic Digit Fragmentation Encryption Scheme Based on the Polynomial Reconstruction Problem
- Author
-
Ahcène Bounceur, Mostefa Kara, Mohammad Hammoudeh, Mohammed Amine Yagoub, Reinhardt Euler, Saci Medileh, and Abdelkader Laouid
- Subjects
Scheme (programming language) ,Polynomial ,Computational complexity theory ,Computer science ,business.industry ,Homomorphic encryption ,Cryptography ,02 engineering and technology ,Encryption ,Field (computer science) ,Market fragmentation ,Computer engineering ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business ,computer ,computer.programming_language - Abstract
In the fast moving field of computer cryptography, researchers are actively working on addressing various emerging challenges to keep tomorrow’s systems secure. Many efforts are focused on addressing the computation speed and the massive data size requirements of today’s systems. Significant research efforts are targeting the computational complexity by focusing on the number of cryptographic operations or the scope of application. In this paper, we present an asymmetric homomorphic encryption scheme that relies on converting base numbers to a given base in such a way that Leveled Fully Homomorphic Encryption (LFHE) is performed. This lightweight technique is easy to implement and applicable in many fields, especially those that require high speed and safety.
- Published
- 2020
- Full Text
- View/download PDF