Quantum-Safe Cloud-Based Safety Methods
Аннотация
As cloud computing has evolved into mainstream practice, data security is arguably one of the most critical concerns. Even with a number of guidelines in place, data breaches still happen. Encryption is nowadays the leading method of protecting data in cloud but this entails any argument developed with quantum computing must be resistant against it - and a bridge between traditional encryption safety and top-tier security for future cases. Therefore, some cryptosystems will survive the test of quantum computing and others become weakened and obsolesced. The paper introduces a model consisting of two important parts, an approach using polynomial ring units encryption variantally utilising the N-th level reduced cryptosystem to protection cloud user data and access control safeguardal cryptography utilizing another emerging post quantum thriller for future replacing Rivest-Shamir-Adleman in Quantum-computing era supporting McEliece. Based on the simulation, we find that the suggested McEliece algorithm is better in time complexity comparing to actual McEliece cryptosystem. In this way, a variable is realized for creative modification of S and P on the one hand to further upgrade suggested algorithms' security level and recommend NTRU cryptosystem over-existent which simulation evinced that time complexity better than previous existed NTRU.