.png){kind=icon}
.png){kind=icon}
Return
Secret image sharing by using multi-prime modular arithmetic
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2022.108882.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
All secret image sharing (SIS) schemes are based on a finite field, on which the generation and recon-struction can be accomplished correctly. To achieve distortionless secret images, a Galois field GF(2m) would be adopted with increased computational complexity. Simple modular arithmetic, on the other hand, is frequently utilized to improve computational efficiency. However, the SIS using simple modular arithmetic is not a completely distortion-free scheme. In this paper, simple modular arithmetic will con-tinue to be investigated to reserve its utility of reducing computational complexity. Multi-prime modular arithmetic is explored for building SIS with multi-prime (referred to as SISw/M) rather than using single -prime modular arithmetic. When dealing with the N-bit frames in a secret image, the prime employed in SISw/M would be closer to the 2 N value, resulting in improved image quality. In addition, with Chinese Remainder Theorem, progressive recovery is provided. Experimental results and comparisons are demon-strated to show the merits (enhanced image quality and progressive recovery) of the proposed approach. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Secret sharing
Secret image sharing
Finite field
Modular arithmetic
Lagrange interpolation
Chinese remainder theorem
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W