Abstract

The vector space projection theory of key decomposition problem is proposed. The key decomposition algorithm is given, and the theory and algorithm are introduced into the research of text segmentation problem. A text security recovery for practical secrecy is given. The algorithm is compared with the traditional text segmentation algorithm. It realizes that the text is first divided into N paragraphs, and then the paragraph is mapped to n sub-texts by using the principle of grouping key. If any m sub-texts are owned, the original text can be restored, which provides security for the storage and transmission of important texts.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call