Název:	Data Validation System Using QR Code and Meaningless Reversible Degradation
Autoři:	Freitas, Lucas F. Nogueira, Adalberto R Vizcarra Melgar, Max E.
Citace zdrojového dokumentu:	2019 International Conference on Applied Electronics: Pilsen, 10th – 11th September 2019, Czech Republic, p.51-54.
Datum vydání:	2019
Nakladatel:	Západočeská univerzita v Plzni
Typ dokumentu:	konferenční příspěvek conferenceObject
URI:	http://hdl.handle.net/11025/35513
ISBN:	978–80–261–0812–2 (Online) 978–80–261–0813–9 (Print)
ISSN:	1803–7232 (Print) 1805-9597 (Online)
Klíčová slova:	ověření dat;QR kód;reverzibilní degradace;Reedovy–Solomonovy kódy
Klíčová slova v dalším jazyce:	data validation;QR code;reversible degradation;Reed-Solomon
Abstrakt v dalším jazyce:	QR Codes are used as information channel on several cryptographic architectures due to their technical properties, such as data capacity and retrieval reliability. This paper presents a novel string data validation system using QR Codes and meaningless reversible degradation. The proposed scheme exploits reversible degradation properties, using the systematic Berlekamp Reed-Solomon error correction algorithm and the QR Code. This new mechanism encodes up to 388 characters in two information channels: a dynamic version QR Code (channel 1) and a wireless network (channel 2). A byte mode QR Code stores partial corrupted and masked data input bits. Its version size varies between 1 and 11 according the stored data quantity. The wireless channel downloads a previous generated Reed-Solomon redundancy file to correct the QR Code retrieved information and decode the secret message. The QR Code information is meaningless when scanned by a standard QR Code reader. Compared to real-time retransmission data validation systems, the proposed scheme reduces the download data (channel 2) up to 50%.
Práva:	© Západočeská univerzita v Plzni
Vyskytuje se v kolekcích:	Applied Electronics 2019 Applied Electronics 2019

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.