IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Analysis of Encryption and Compression Techniques for Hiding Secured Data Transmission

Analysis of Encryption and Compression Techniques for Hiding Secured Data Transmission
View Sample PDF
Author(s): M. Ravi Kumar (Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education Foundation, India), K. Mariya Priyadarshini (Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education Foundation, India), Chella Santhosh (Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education Foundation, India), J Lakshmi Prasanna (Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education Foundation, India) and G. U. S. Aiswarya Likitha (Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education Foundation, India)
Copyright: 2022
Pages: 14
Source title: Advanced Practical Approaches to Web Mining Techniques and Application
Source Author(s)/Editor(s): Ahmed J. Obaid (University of Kufa, Iraq), Zdzislaw Polkowski (Wroclaw University of Economics, Poland) and Bharat Bhushan (Sharda University, India)
DOI: 10.4018/978-1-7998-9426-1.ch014

Purchase

View Analysis of Encryption and Compression Techniques for Hiding Secured Data Transmission on the publisher's website for pricing and purchasing information.

Abstract

Galois finite field arithmetic multipliers are supported by two-element multiplication of the finite body thereby reducing the result by a polynomial p(x) which is irreducible with degree m. Galois field (GF) multipliers have a variety of uses in communications, signal processing, and other fields. The verification methods of GF circuits are uncommon and confined to circuits of critical information sources and yields with realized piece locations. They also require data from the final polynomial P(x), which affects the execution of the final equipment. Here the authors introduce a math method that is based on a PC variable that easily verifies and figures out GF (2m) multipliers from the use of the initial level and compares with Vedic multiplier and Wallace tree multiplier. The technique relies on the parallel elimination of extraordinary final polynomial and proceeds in three phases: 1) decision of the yield bit – the situation is made; 2) decision of the info bit – the situation is made; and 3) the invariable polynomial used in the structure is segregated.

Related Content

T. Ramathulasi, U. Kumaran, K. Lokesh. © 2022. 13 pages.
Avinash Kumar, Bharat Bhushan Kumar, Saptadeepa Kalita, Rajasekhar Chaganti, Parma Nand. © 2022. 22 pages.
Mohammad K. Daradkeh. © 2022. 27 pages.
B. M. Arifuzzaman, S. M. Niaz Mahmud, Ayman Muniat, A. K. M. Bahalul Haque. © 2022. 27 pages.
Tyler W. Soiferman, Paul J. Bracewell. © 2022. 16 pages.
Sonia Tasmin, Asma Khanam Sarmin, Mitul Shalehin, A. K. M. Bahalul Haque. © 2022. 32 pages.
Avinash Kumar, Bharat Bhushan, Nandita Pokhriya, Raj Chaganti, Parma Nand. © 2022. 25 pages.
Body Bottom