Enhancement of QR Code Capacity by Encrypted Lossless Compression Technology for Verification of Secure E-Document

26Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper provides a novel method to improve the data storage of a quick response code (QR code) by applying encrypted lossless compression technology. QR codes are used in several domains, particularly when there is a need to transfer various types of text information. A key aspect of this work is to thus propose a new methodology to overcome the weaknesses of the limited size of the traditional QR code, which has long been an important issue in a wide range of areas. The proposed algorithm incorporates a clear and simple plan for overcoming this difficulty by inserting confidential information into a QR code message. The QR code is updated through the addition of levels that help to share secure messages of various sizes and to authenticate documents for verification and validation. In this work, the newly proposed QR code does not reconstruct the configuration or structure of the QR code. Rather, it provides better security because it relies on the features of the Huffman compression algorithm to reduce the size of the input data and the principles of encryption through the XOR function, which is done through a variable encryption key. The experimental results show the superiority of our method over the previous methods. The scope of this endeavour is thus wide, and there is potential for the encoding of different types of data with a high compression rate in the near future.

Cite

CITATION STYLE

APA

Mohammed Ali, A., & Farhan, A. K. (2020). Enhancement of QR Code Capacity by Encrypted Lossless Compression Technology for Verification of Secure E-Document. IEEE Access, 8, 27448–27458. https://doi.org/10.1109/ACCESS.2020.2971779

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free