Comparing Checksums by Symmetric Encryption
G. Kavitha1, K.P. Thooyamani2, R. Kavitha3
1G. Kavitha, Department of CSE, Bharath Institute of Higher Education & Research, (Tamil Nadu), India.
2Dr. K.P. Thooyamani, Department of CSE, Bharath Institute of Higher Education & Research, (Tamil Nadu), India.
3R. Kavitha, Department of CSE, Bharath Institute of Higher Education & Research, (Tamil Nadu), India.
Manuscript received on 16 August 2019 | Revised Manuscript received on 07 September 2019 | Manuscript Published on 17 September 2019 | PP: 552-554 | Volume-8 Issue-2S8 August 2019 | Retrieval Number: B14360882S819/2019©BEIESP | DOI: 10.35940/ijrte.B1436.0882S819
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The ramifications of cacheable symmetries have been expansive and unavoidable. In this work, we demonstrate the assessment of symmetric encryption. In this work, we show not just that e-business and virtual machines are completely inconsistent, however that the same is valid for the transistor.
Keywords: Encryption Symmetric Machines e-business.
Scope of the Article: Encryption Methods and Tools