Improvising data security measures using rajan transform

Title

Improvising data security measures using rajan transform

Creator

Vishnoi A.; Sharma D.; Prateek M.

Description

Data security has always been a concern with the use of a large amount of data in our day-to-day life. There are many methods suggested and presented to secure data during the stages of its preprocessing and post-processing. However, many of them are not following the process of Homomorphism. During the study of Fast Fourier transform (FFT), Hadamard transform (HT) and Rajan transform (RT), this research work encountered a method that uses the cyclic, dyadic and graphical inverse properties of data and encrypts them which makes them homomorphic. This paper is targeting to improvise the data security measures using Homomorphism-based Rajan Transform, a method, which can help in securing data while data processing. The proposed methodology works in such a way that the encrypted data is available for processing without decrypting data into the original form. The performance of the proposed method is described by the efficiency of the algorithm, key size, Block size, and no of rounds required to complete the encryption. It has been found, if we take 512 bits of input data to get 512-bit ciphertext, it takes 9 rounds and generates a 4608-bit key. 2021 Taylor's University. All rights reserved.

Source

Journal of Engineering Science and Technology, Vol-16, No. 6, pp. 4920-4932.

Date

2021-01-01

Publisher

Taylor's University

Subject

Cyclic; Data security; Dyadic; Graphical inverse; Homomorphic transform; Rajan transform

Coverage

Vishnoi A., University of Petroleum and Energy Studies, Dehradun, India; Sharma D., Christ University, Delhi, India; Prateek M., Dev Bhoomi Uttarakhand University, Dehradun, India

Rights

Restricted Access

Relation

ISSN: 18234690

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121111468&partnerID=40&md5=457b2bc5251c3a0afcc0661722f7ea76