Text Secret Sharing Scheme Based on Shamir Polynomials
Yinong Song, Haiyang Ding, Zichen Li · 2024
With the rapid development of information technology, the security of text documents processed through networks has become a significant concern in people's daily lives and work. This paper proposes a text secret sharing scheme with a specific secret distribution method. The main idea of the algorithm is to first convert the secret information in the txt file into corresponding ASCII codes, then use a Shamir-based polynomial secret sharing scheme to obtain sub-secret information. Simultaneously, a special random distribution method is used to store the sub-secret information in the corresponding txt files for distribution. When restoring, specific shares of sub-secret information are required for extracting specific character information at certain positions. Through Lagrange interpolation operations and character conversion, the original secret information can be obtained. Experimental results demonstrate that this text secret sharing scheme ensures the security of secret information storage and transmission.