One method of storing information

TL;DR

This paper introduces a simple secret sharing method that divides a file into parts and reconstructs it without complex calculations, using only division and concatenation operations.

Contribution

The proposed method offers a calculation-free approach to secret sharing by dividing and concatenating file parts, simplifying the process compared to existing methods.

Findings

Requires no calculations for secret sharing

Uses only division and concatenation of file parts

Simplifies secret sharing process

Abstract

Formulate the problem as follows. Split a file into n pieces so that it can be restored without any m parts (1<=m<=n). Such problems are called problems secret sharing. There exists a set of methods for solving such problems, but they all require a fairly large number of calculations applied to the problem posed above. The proposed method does not require calculations, and requires only the operations of the division of the file into equal (nearly equal) parts and gluing them in a certain order in one or more files.