Design and Implementation of Discrete Field Arithmetic-Based Cylindrical Coil-Driven Crypto Framework for Cloud Data

Smitha  Sasi; Srividya Bharadwaj Venkata  Subbu; Premkumar Manoharan; Anju  Vijayakumar Kulkarni; Laith  Abualigah

doi:10.47852/bonviewJCCE42022816

Authors

Smitha Sasi Department of Electronics and Telecommunication Engineering, Dayananda Sagar College of Engineering, India https://orcid.org/0000-0002-5955-3406
Srividya Bharadwaj Venkata Subbu Department of Electronics and Telecommunication Engineering, Dayananda Sagar College of Engineering, India https://orcid.org/0000-0003-3651-4196
Premkumar Manoharan Department of Electrical and Electronics Engineering, Dayananda Sagar College of Engineering, India https://orcid.org/0000-0003-1032-4634
Anju Vijayakumar Kulkarni Department of Electronics and Telecommunication Engineering, Dayananda Sagar College of Engineering, India
Laith Abualigah MEU Research Unit, Middle East University and Applied Science Research Center, Applied Science Private University, Jordan https://orcid.org/0000-0002-2203-4549

DOI:

https://doi.org/10.47852/bonviewJCCE42022816

Keywords:

cloud, cryptography, decryption, encryption, finite field

Abstract

The ability to interpret and create code is known as cryptography and has been used to exchange information between peer parties securely. An encryption algorithm is a type of network security model that consists of designing and putting into practice cryptographic algorithms and the supporting framework to help secure data. This cryptosystem is intended for use with cloud data. Cloud security, usually called cloud computing security, is the technique of securing infrastructure, applications, and data stored in the cloud from cyber threats and attacks. This study proposes a new encryption method based on the (x; y) points generated by circles to protect data in the cloud. Using a map table, a new mapping technique is shown in this study to transfer a plain text value to a point on a predetermined circle over the finite field GF (p^m). This mapping technique produces a high dispersion of various spots for recurrent intensity values while being highly quick, simple to use, and with low entropy for plain text input. The implementation of the encryption and decryption processes is extensively studied and analyzed. Security analysis is done after encryption is implemented to determine how resilient the suggested technique is against statistical threats. The results shown in this study prove the superiority of the proposed algorithm.

Received: 12 March 2024 | Revised: 24 May 2024 | Accepted: 31 May 2024

Conflicts of Interest

The authors declare that they have no conflicts of interest to this work.

Data Availability Statement

Data sharing is not applicable to this article as no new data were created or analyzed in this study.

Author Contribution Statement

Smitha Sasi: Conceptualization, Methodology, Software, Validation, Investigation, Data curation, Writing – original draft, Visualization. Srividya Bharadwaj Venkata Subbu: Conceptualization, Methodology, Validation, Investigation, Data curation, Writing – original draft, Visualization. Premkumar Manoharan: Software, Validation, Formal analysis, Resources, Writing – review & editing, Visualization, Supervision, Project administration. Anju Vijayakumar Kulkarni: Formal analysis, Resources, Writing – review & editing, Supervision. Laith Abualigah: Formal analysis, Resources, Writing – review & editing.