This article presents a new method of cryptographic data encryption. The principle of operation consists of processing input data-changing the structure in a keyless format. There are a sufficient number of similar algorithms, which have the names symmetric and asymmetric. They work with keys for encryption or decryption. The new method will make it possible to process data according to the appropriate algorithm without changing the size of the input data, only by changing the structure, and also without using a key for decryption. For decryption, you need to apply the proposed algorithm in the reverse order. Currently, communication systems are gaining popularity, because society wants to maintain contact with others remotely, as well as with the security of personal data. The data loss of some systems has been noticed repeatedly, so in addition to displaying the new algorithm, the principle of data organization and management, which is called a “Linked System”, will be displayed. A significant number of systems are closed. They use other methods to keep data confidential. In addition to saving data, data may also be transferred. Transmission is carried out through communication channels, namely certain protocols. Some systems use special communication protocols to connect clients to the server. Each protocol can have a different data structure. The principle of application of the algorithm does not depend on the very structure of the system on which the corresponding protocol works. The algorithm is applied to all data that can be transmitted over the network mesh to which the clients are connected. Thanks to the individual approach, it is possible to achieve data reliability, as well as avoid the use of device resources thanks to an optimized algorithm and some software development tools.
Developers of various systems try to maintain
data privacy and security. At the same time,
decisions are made to use already existing
cryptographic encryption methods from primary
sources [
The state of confidentiality of some communication and other systems was investigated, and it was noticed that the necessary information of users was repeatedly obtained by attackers. Because the general structure and encryption algorithms are already known, the probability of obtaining data is an order of magnitude higher for criminals.
An individual approach is required to ensure
data reliability. As an example, try to create your
data processing algorithm, electronic digital
signatures, and communication protocols, and
apply them in centralized or other data
organization systems that work on the appropriate
communication to receive or transfer, or store data
[
In addition, various services that provide
individual services use different systems of
organization and data management. The choice of
one or another system is individual for everyone.
To find a balance between security and economy,
it was decided to investigate the working
principles of already known data organization
algorithms and develop the newest one [4].
development tools, you can get the decimal value
of a byte right away, where the replacement
process is much more simplified [
of the Issue, and the Statement of the
Currently, there are several ways to organize data for any system. Among them, the following are known: centralized, decentralized, and distributed. Centralized can be suitable for use by any software, because the principles of data management are simple [5]. Decentralized is usually used to check data for validity and reliability [6]. Distributed ones work according to a similar principle of decentralized methods, but partially with the duplication of information on each server device to increase the fault tolerance of the system [7].
Data stored internally in operating and other systems consist of bytes. It can be called a standardized form of digital information. A byte is a certain length of a binary code, which is replaced by a symbol or a special symbol during encoding [8].
When creating your cryptographic encryption algorithm, you should take into account the properties: confidentiality, immutability, and source [9]. Confidentiality remains for all users of systems where an appropriate data protection method is used. Immutability indicates that the data sent to the system must not change so that the system itself has the opportunity to verify the source. The system user confirms the sent data.
There are enough cryptographic encryptions.
They can be distinguished by signs—symmetric
and asymmetric. Symmetric methods work only
with a public key, which is called “public” [
The change in the internal structure of the data
occurs due to the change in the positions of
symbols and special symbols that directly form
the input data [
For several years, the use of various methods of data organization has been necessary to use for the development of any online or offline platform. The prerequisite for this is the permanent storage or retrieval of data, where the appropriate technique helps to most effectively solve several issues.
Client-server architectures often use centralized methods. Services that require data security and verification, such as services with cryptographic currencies, use decentralized solutions. For high security and failure resistance of server devices, distributed methods of data organization are used.
Some popular companies use one of the existing methods. Centralized solutions were chosen by the developers of the well-known Instagram, Facebook, and Telegram tools. Decentralized was chosen by the developers of cryptographic currencies Bitcoin, and Etherium. Distributed methods used by Google in its search engine.
Each development company is looking for the most effective method of data organization, which will result in less equipment costs, support, and scaling. At the same time, high-quality customer service will be obtained.
After analyzing the existing methods and systems, no optimal solution was found among the existing ones, which would give fewer costs for device maintenance and provide sufficient computational efficiency, in particular, a sufficient level of data security.
A few years ago, centralized systems were popular in creating a variety of applications.
A centralized system (center) is a way of
organizing data that contains all information and
processes input data with a single device. Fig. 1
shows an example of data organization by
centralizing them [
To create a centralized system, several software components need: 1. Communication protocol. For users of the corresponding system to be able to receive data, a certain protocol is used: TCP, FTP, UDP, etc. 2. Database. Since the protocols do not include data storage methods, a database is used to obtain preliminary information.
Centralization is used by a sufficient number of applications, including web applications. This type of organization is less secure in terms of data storage, but at the same time, it is more economical. As an example, it is used by the famous application Instagram. While researching the possibility of “breaking” the system internally, several cases were observed, and the employees of this company needed to come to certain locations where the server devices are located and fix them.
By this we can say that the destruction of the entire system can occur by the destruction of one component of the system—the server device.
After some time, in the 80s and 90s, the concept of a decentralized system appeared, followed by the methodology of creating decentralized systems.
A decentralized system is a set of blocks that
contain certain data and increase their security
level by hashing (each block) and verifying the
validity of this data. Fig. 2 shows the principle of
decentralized data organization [
A hash function is a function that transforms
input data of any length into a fixed length [
The requirements for the hash function are as follows: 1. Resistance of collisions 2. Resistance to finding the prototype 3. Resistance to the search for a second prototype.
Collisions. Collision resistance means that there is no algorithm for finding a collision in a short period. A collision is a situation where there is a pair of values that, by applying to the input of the function, you can get a valid result.
The first prototype. This is a requirement for a hash function where updating the initial data in an adequate amount of time is not possible.
The second prototype. The party that has the initial data and the corresponding hash value cannot create other data that will return the same result at the input of the hash function.
Similar systems contain data blocks. All blocks are interconnected, because each previous block is processed by a hash function, and data is transferred to the new block. This method of organization is called blockchain in decentralized systems. In this case, it is difficult to replace the data, because devices or a certain device are used, which contain all the data for further validation.
Validation occurs thanks to other devices that constantly compare their values with the server values—consensus.
Consensus is the validation of data by using a
variety of methods. There are a sufficient number
of data verification methods [
All methods are based on proof, but some are based on work and luck. As an example, the Delegated Proof-of-Stake principle describes below: 1. Delegate. The user who controls governance in the blockchain. 2. Validator. Nodes that verify the correctness of the consensus. 3. Witnesses Users responsible for blockchain security and validation.
Cryptocurrencies usually use for decentralization.
A distributed system is a way of organizing data that distributes data across multiple server devices. Fig. 3 shows an example of data organization by distribution.
This type of organization also includes
consensus. To receive, update, and delete data,
voting takes place between existing server
devices. Among them is the main device—the
controller. When the control server is lost, a vote
is taken to select a new control device [
Because some parts of the data can be stored not only on one device but also possibly on several. This causes high failure resistance in the system. But at the same time, the design and costs of such a system increase significantly, because not only data is distributed, but also hardware resources. As an example, the Google Chrome application is the largest distributed system in the world.
and Management
A linked system is a way of organizing and managing data that divides data into N-parts (blocks) and distributes them across N-devices, without keeping duplicates. The recommended number of server devices for applying this data organization methodology is 3 or more. From a smaller number of devices, it makes no sense to build such a system, as well as a distributed or decentralized one.
Fig. 4 shows the principle of operation of the connected system.
To create and apply this system, it is necessary to decide on a conditional structure. There are 3 server devices (S1–S3), one “empty” (E) and one spare (R). A user is connected to S2 and is sending data. In this case, the program initially encrypts the data in an E2E (end-to-end) way, divides it into 3 parts, puts it in a queue, and sends it to all S. Thanks to the queue, the data transmission is synchronized, and does not need to use the computing power of other servers, until which the data gets, only the network load. All data that has been received must be sent to R via E at an appropriate frequency, where E signals R to open an individual communication channel for data transmission.
Assume that S2 has failed. Then the data will be received from R through E by opening a data channel. The R device serves to restore data if it has been lost so far, as well as to partially replace a non-working server. The system will work as long as at least 1 server is running. The idea of a backup server is just to be a container for data, and should not have a lot of computing power.
It may be that you need to scale the system. Then, after installing a new server device, data is transferred from the backup device to the new one: (1) where N is the total number of servers, M is the number of new devices.
When the data wrote, other working servers continue to work, but only to receive users, without returning data from their database, redirecting user requests to new servers. The database of previous servers is overwritten. Thanks to such processing, a certain number of users is not lost, but at the same time, there is a load on the network of new servers: where I is the maximum speed of the Internet, P is the number of connected users (threads).
After summing up the likely scaling events of the associated system, it is possible to calculate the amount of memory that will be freed up when new devices are added (3). (2) (3) where Vi is the amount of physical memory of the current device, N is the number of devices, M is the number of new devices.
There are a sufficient number of methods for
organizing communication between devices.
Among them, TCP/IP, UDP, FTP, HTTP, and
others are used [
The corresponding protocol is used for the corresponding tasks. The TCP/IP protocol is in high demand in the design of client-server architectures. In addition, developing software using this protocol requires a minimum of system costs, so it was decided to choose this option.
TCP/IP (Transmission Control Protocol,
Internet Protocol) is a network model of data
transmission, which is presented in digital form.
This model includes 4 stack levels [
The interaction of devices in a connected system takes place at the network level because it is necessary to transfer relevant information to several devices while maintaining data security.
Data security can be maintained at the network
level, because this level contains: identifier, flag,
source address, destination address, parameters,
data, etc. The way the data is addressed is defined,
so only the data itself that needs to be transferred
is processed. Data processing can be done in
different ways, including the use of cryptographic
encryption methods [
To determine the quality of the proposed system, it was decided to compare it with all existing data management and organization systems.
Failure resistance: a) Centralized—low b) Decentralized—medium c) Distributed—high d) Linked—high.
Service: a) Centralized—low b) Decentralized—medium c) Distributed—high d) Linked—high Scalability: a) Centralized—low b) Decentralized—medium c) Distributed—high d) Linked—high.
Development: a) Centralized—high b) Decentralized and Distributed—medium c) Linked—medium.
Evolution: a) Centralized—low b) Decentralized—medium c) Distributed—high d) Linked—high.
You can compare and find the differences between distributed and connected systems: 1. Safety. Compared to a linked system, complete data is not stored on multiple servers. While the data of the linked system is stored on all available devices in blocks. 2. Data storage. Distributed systems duplicate data, as a result of which there is a high failure resistance to the loss of one or more servers. In a connected system, data is divided into blocks and distributed on servers, where if one is lost, the backup can be replaced, but without using its computing power to receive users, only for data transmission. 3. Costs and design. A distributed system is difficult to design and particularly expensive. The related system will be less expensive due to the efficient use of memory when scaling (3), and at the same time, it is not difficult to design. 4. The speed of receiving/returning data. In a distributed system, the data has a complete form. Due to this, the speed will be lower compared to the related one, which has a block system of data storage.
A symmetric cryptosystem is a way to increase the level of software protection by changing the data structure with a special unique key.
The key is a set of secret information, thanks to which the digital signature of the document and other data is verified.
The key is required to process the data structure for both encryption and decryption. The same key is required to process the same information. If the key is lost, it will not be possible to get complete information.
Asymmetric cryptosystems are a way of increasing the protection of software using an external and an internal key.
The foreign key is used in symmetric encryption methods. Internal—in asymmetrical ones. The difference between these types of encryption is the formation of two keys for encryption and decryption of data in asymmetric encryption.
The external key is available to all recipients
of data, and the internal key is unique and is
available to each recipient of information. These
two keys help to decrypt fully protected
information. The only drawback of the
asymmetric type of encryption is the speed of
processing [
Cryptographic encryption is the replacement of the data structure with symbols and the creation of a certain key to replace the symbols with the original structure. Encryption is used for three purposes: 1. Privacy. Thanks to cryptographic protection methods, information can be made inaccessible to persons trying to steal this information. 2. Immutability. Encrypted information cannot be tampered with during transmission or storage. 3. Confirm the source. Encrypted information has information about the sender.
Data exchange between users occurs as follows: 1. The original text, image, and video are transformed into an encrypted form with the help of an algorithm, and the recipient will have a special key to decrypt this data. 2. The encrypted message is sent to the recipient.
The receiver decrypts the message using a special key.
The initial data can be different—bytes or text information. When receiving text information, it is necessary to convert it into bytes. A byte is a unit of storage and processing of digital information, which can have values from 0 to 256 for one character.
Some development tools can immediately
convert symbols into bytes, while the processing
process becomes automated, in particular, faster
[
The TDM data processing algorithm is as follows: 1. Receiving input data and, if necessary, converting it to bytes. 2. Distribution of data into 6 parts with their processing with step 12: a) Parts 1 and 2 with the initial processing position 0 carry out the replacement of the values N and N+1. b) Parts 3 and 4 with processing start position 2 perform value substitution from N to N+2 and from N+2 to N+4. c) Parts 5 and 6 with the initial processing position 6 carry out the substitution of values from N to N+3 and from N+3 to N+6. 3. Replacement of the first half of the original values with another. 4. Saving the result.
For decryption, it should be taken into account that the value of the length of the input encrypted data may not be even, therefore, at the beginning of the decryption, it is necessary to determine the percentage by dividing the length by 2 for further correctness of the result—permutation of halves. Then the decoding is in reverse order.
When using this approach, difficulties may
arise with the processing of large data. As an
example, 1GB can take a relatively long time to
process. In this case, the input data should be
divided into blocks that will process parts
according to the same algorithm [
At the moment, communication systems are rapidly gaining popularity. In most of them, data security is determined by the use of cryptographic encryption methods. The processing of the data itself takes place thanks to certain algorithms on the input data of users. The data structure is a message. To use the proposed algorithm, you should convert text information into bytes, then apply the proposed or algorithm. Any data consists of bytes regardless of the system, so the flexibility of use lies in this, in particular the speed of processing.
Other closed systems process and transmit data via communication channels. Such systems use specific communication protocols to connect clients to the server. Each protocol may have a different data structure and operating principles. Regardless of the principle of operation and data structure, information processing can be carried out.
Currently, there are a sufficient number of
algorithms for increasing the level of data
protection: AES, DES, 3DES, and others. These
methods are symmetrical [
Both symmetric and asymmetric algorithms
have drawbacks. Symmetric encryption methods
use a single key to encrypt and decrypt data. This
contributes to a greater probability of receiving
valid data from the attacker. Asymmetric
algorithms solve the problem using a single key.
But in this case, more computing power is needed
to process the data before obtaining their proper
appearance [
During the study of the performance of the TDM method, it was observed that unique values were obtained from the input. At the same time, it can be assumed that data security is at a high level. It can be assumed that a set of bytes of data can be defined by a single character of length Ncharacters of the same type. In this case, the attacker can more likely choose an algorithm to decrypt the message. This assumption applies to known symmetric and asymmetric algorithms. Next, you can define the level of data security for all types of encryption: 1. No key method. The security level is sufficient. 2. Symmetric method. The security level is medium. 3. Asymmetric method. The security level is high.
This level of security is due to the openness of the digital sequence of values, namely keys, as well as the time spent to obtain valid data illegally.
This paper considered well-known methods of data organization and management, which are in demand among companies that develop or design a service delivery system.
During the analysis of all methods, it was decided to develop a new method of data organization and compare it with the existing ones. As it was shown, a system with its potential was obtained, with its evaluation according to the relevant criteria.
In addition, the principle of operation of the TDM method was displayed. Thanks to the individual approach to increasing the level of data protection, software developers have the opportunity to create an individual method of data encryption.
No device resource usage was observed during the TDM method development study. This makes it possible to apply the algorithm on most devices that need to save computing power for computing other data.
Currently, communication systems are gaining popularity in society. Therefore, a decision was made to create our communication system and use a data processing algorithm. The algorithm made it possible to increase the level of data protection on the users’ devices themselves without using the resources of the server and their own devices. Thanks to this, conditional attackers will have a lower probability of obtaining valid data due to an individual approach to increasing the reliability of personal information.