A lossless secret image sharing scheme using a larger finite field

Autor:	Yanzhao Shen, Ting Wu, Lifeng Yuan, Wei-Tong Hu, Yuanfang Chen
Rok vydání:	2021
Předmět:	Lossless compression Polynomial Computer Networks and Communications Computer science Galois theory Image sharing Lossy compression Image (mathematics) Permutation Finite field Hardware and Architecture ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Media Technology Algorithm Software
Zdroj:	Multimedia Tools and Applications. 80:28731-28743
ISSN:	1573-7721 1380-7501
DOI:	10.1007/s11042-021-11104-7
Popis:	Recent research has made an effort to take 8b-bit value as a polynomial coefficient and use a random number as the maximum coefficient term in a Shamir’s polynomial, where b > 0. These can help improve computationl efficiency by reducing the sum of calculating polynomials, and avoid the case of the coefficient of xk− 1 being zero. However, such research still has the issues of requiring much extra storage space, lossy secret image, shadow images with large size, and storing permutation key. To solve the above issues, in this paper, we propose a novel scheme which takes 8b-bit value as a polynomial coefficient, designs a bit-level method and runs under Galois Field GF(28b). Experimental results show that this scheme improves existing similar schemes on several aspects, such as less extra storage space and higher computational performance.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::994a3092b480d6816ca5ecba7a029856 https://doi.org/10.1007/s11042-021-11104-7 Zobrazit plný text záznamu Full text from SpringerLink