A secret sharing scheme based on integer decomposition and hexagonal structure

Security is a major challenge in storage and transmission of digital data. Secret sharing scheme is a fundamental primitive used in multiparty computations, access control and key management, which is based here on two concepts, namely: hexagonal structure and integer decomposition. Use of hexagonal structure is common in biological modelling. For integer decomposition, the oldest known method is Fermat’s factorisation, while for the proposed decomposition, the factorisation uniqueness of positive integer into two factors is exploited. Experimental results obtained from the applied scheme to digital images reveal interesting properties; this scheme turns out to be lossless, ideal, flexible, extensible, and even can detect and identify cheater; in sum, it has a good security. © 2024 Inderscience Enterprises Ltd.