CN115396092B - Data management method of intelligent cardiac function treatment system - Google Patents
Data management method of intelligent cardiac function treatment system Download PDFInfo
- Publication number
- CN115396092B CN115396092B CN202211028784.XA CN202211028784A CN115396092B CN 115396092 B CN115396092 B CN 115396092B CN 202211028784 A CN202211028784 A CN 202211028784A CN 115396092 B CN115396092 B CN 115396092B
- Authority
- CN
- China
- Prior art keywords
- binary
- route
- encrypted
- strings
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0631—Substitution permutation network [SPN], i.e. cipher composed of a number of stages or rounds each involving linear and nonlinear transformations, e.g. AES algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/088—Usage controlling of secret information, e.g. techniques for restricting cryptographic keys to pre-authorized uses, different access levels, validity of crypto-period, different key- or password length, or different strong and weak cryptographic algorithms
Abstract
The application discloses a data management method of an intelligent cardiac function treatment system, and relates to the technical field of data management. Mainly comprises the following steps: coding data to be processed in the cardiac function treatment system and dividing binary strings, respectively determining a first route pattern corresponding to each binary string according to a first corresponding relation table, obtaining a second route pattern taking a termination vertex of the first route pattern as a starting vertex, and combining the first route pattern and the second route pattern into a third route pattern; and respectively determining the encrypted binary strings corresponding to each third route pattern according to the second corresponding relation table, and sequentially arranging all the encrypted binary strings to obtain processed data. The processed data obtained by the embodiment of the application ensures high confidentiality and can effectively avoid data leakage in the intelligent cardiac function treatment system.
Description
Technical Field
The application relates to the technical field of data management, in particular to a data management method of an intelligent cardiac function treatment system.
Background
A smart cardiac function therapy system is a system for managing data related to cardiac function of a patient, wherein the data related includes: patient health, patient cardiac performance, patient recent medication, medical images related to the course of treatment, and patient personal information (e.g., patient name, age, gender, weight, and billing information), etc.
Because these data relate to patient's personal privacy, therefore, need to manage these data in the intelligent heart function treatment system to avoid plaintext information disclosure, thereby guarantee the security of data, at present, the conventional art adopts well-known encryption methods such as DES (Data Encryption Algorithm, data encryption standard) to manage after data encryption, is easily broken and leads to the data disclosure in the heart function treatment system, causes hidden danger to data security.
Disclosure of Invention
In view of the above technical problems, it is necessary to provide a data management method for an intelligent cardiac function treatment system to avoid data leakage in the intelligent cardiac function treatment system, aiming at the problem of low safety in the conventional technology.
The embodiment of the application provides a data management method of an intelligent cardiac function treatment system, which comprises the following steps:
the data to be processed in the cardiac functional therapy system is encoded into binary data and the binary data is divided into a plurality of binary strings of length 4.
And respectively determining a first route diagram corresponding to each binary string according to a first corresponding relation table, wherein the first corresponding relation table comprises the corresponding relation between the binary string and the first route diagram, the first route diagram comprises routes passing through 4 vertexes arranged in a 2 multiplied by 2 way, and the routes are directed to the ending vertexes from the starting vertexes and only pass through each vertex once.
Obtaining a second route map taking a termination vertex of the first route map as a start vertex, wherein the second route map comprises routes passing through 4 vertices in a 2×2 arrangement, the routes point to the termination vertex from the start vertex and pass through each vertex only once, and the width and the height of a third route map formed by combining the first route map and the second route map are 3.
And respectively determining the encrypted binary strings corresponding to each third route pattern according to a second corresponding relation table, and sequentially arranging all the encrypted binary strings to obtain processed data, wherein the second corresponding relation table comprises the corresponding relation between different types of third route patterns and different encrypted binary strings.
Optionally, in the data management method of the intelligent cardiac function treatment system, the method further includes:
the 8 binary strings with the largest frequency among all binary strings with the length of 4 are used as high-frequency binary strings.
And taking the binary strings except the high frequency binary string in all the binary strings with the length of 4 as the low frequency binary strings.
Each high-frequency binary string corresponds to 2 different first route patterns in the first corresponding relation table, each low-frequency binary string corresponds to 1 first route pattern in the first corresponding relation table, and the first route patterns corresponding to all binary strings are different.
In the process of determining the first route patterns corresponding to each high-frequency binary string, randomly selecting from 2 first route patterns corresponding to each high-frequency binary string.
Optionally, in the data management method of the intelligent cardiac function treatment system, lengths of all encrypted binary strings corresponding to all third route patterns are the same.
Optionally, in the data management method of the intelligent cardiac function treatment system, the method further includes:
two encrypted binary strings of different lengths exist in all encrypted binary strings corresponding to all third route patterns.
Different identifiers are inserted before the encrypted binary strings with different lengths, and the encrypted binary strings with the identifiers inserted are used as new encrypted binary strings, wherein the identifiers are 1 or 0.
Optionally, in the data management method of the intelligent cardiac function treatment system, before each encrypted binary string corresponding to each third route pattern is determined according to the second corresponding relation table, the method further includes: and randomly generating a specific corresponding relation from the corresponding relations of all the third route patterns and the encrypted binary string to obtain a second corresponding relation table.
Optionally, in the data management method of the intelligent cardiac function treatment system, the method further includes: and performing AES encryption on the processed data by using the generated key to obtain encrypted data.
Optionally, in the data management method of the intelligent cardiac function treatment system, the method further includes: and performing AES decryption on the encrypted data according to the secret key, and decrypting the processed data.
Optionally, in the data management method of the intelligent cardiac function treatment system, after decrypting the processed data, the method further includes:
and determining the length of the intercepted encrypted binary string according to the first character of the processed data, and sequentially completing the interception of all the encrypted binary strings.
And respectively determining a third route diagram corresponding to each intercepted encrypted binary string according to the second corresponding relation table.
And determining a second route pattern corresponding to the intercepted encrypted binary string according to a third route pattern corresponding to the intercepted encrypted binary string, and determining the binary string corresponding to the second route pattern according to the first corresponding relation table so as to obtain the binary string corresponding to the intercepted encrypted binary string.
And arranging the binary strings corresponding to each encrypted binary string according to the sequence of intercepting the encrypted binary strings to obtain arranged binary data.
Optionally, in the data management method of the intelligent cardiac function treatment system, in the process of dividing binary data into a plurality of binary strings with length of 4, the method further includes: if the length of the last binary string obtained after division is less than 4, the length of the last binary string is supplemented by 0 in the low bit of the last binary string to be supplemented to 4.
Compared with the prior art, the data management method of the intelligent cardiac function treatment system has the beneficial effects that: the data to be processed is divided into binary strings, a first route pattern corresponding to each binary string is obtained respectively, a second route pattern corresponding to the first route pattern is determined according to the first route pattern, and the first route pattern and the second route pattern are formed into a third route pattern, so that the encrypted binary string corresponding to the third route pattern is used as the encrypted binary string corresponding to the divided binary string, the connection between the encrypted binary string and the divided binary string is disturbed, and due to the fact that multiple types exist in the first route pattern and the second route pattern in the encryption process, the encryption degree of the obtained processed data is further improved, high confidentiality is guaranteed, and data leakage in an intelligent heart function treatment system can be effectively avoided.
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the application, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flow chart of a data management method of an intelligent cardiac function treatment system according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a first route diagram in an embodiment of the application;
FIG. 3 is a schematic diagram of 6 different first route patterns of the same initial vertex in an embodiment of the application;
FIG. 4 is a schematic diagram of a process for obtaining a second route map corresponding to the first route map according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a process for obtaining an encrypted binary string corresponding to a binary string of length 4 in an embodiment of the present application;
fig. 6 is a schematic diagram of a process for obtaining a binary string of length 4 corresponding to an encrypted binary string in an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
The terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first", "a second" may include one or more such features, either explicitly or implicitly; in the description of the present embodiment, unless otherwise specified, the meaning of "plurality" is two or more.
The embodiment of the application provides a data management method of an intelligent cardiac function treatment system, as shown in fig. 1, comprising the following steps:
step S101, data to be processed in the cardiac function treatment system are encoded into binary data, and the binary data are divided into a plurality of binary strings with the length of 4.
The heart function refers to the pumping function of the heart, which is a dynamic organ for promoting blood circulation, and through regular contraction and relaxation, blood of venous return heart can be injected into arteries, a certain cardiac output and arterial blood pressure are maintained, the blood circulation of each tissue organ of the body is ensured, and the heart function can be divided into a left heart function and a right heart function according to different heart parts and into a contraction function and a relaxation function according to different time phases of a heart cycle.
A smart cardiac function therapy system is a system for managing data related to cardiac function of a patient, wherein the data related includes: patient health, patient cardiac performance, patient recent medication, medical images related to the course of treatment, and patient personal information (e.g., patient name, age, gender, weight, and billing information), etc.
Meanwhile, commonly used cardiac function indexes include left ventricular ejection fraction, type B natriuretic peptide, N-terminal type B natriuretic peptide, 6-minute walking test, new york cardiology council function classification, and the like.
In the embodiment of the application, the data to be processed in the cardiac function treatment system is encoded into binary data so as to carry out the subsequent data processing process.
Meanwhile, in the embodiment of the application, binary data is divided into a plurality of binary strings with the length of 4, so that the encrypted binary strings corresponding to each binary string are conveniently obtained in the subsequent steps, and the processed data corresponding to the data to be processed in the cardiac function treatment system is obtained according to each encrypted binary string.
In one embodiment, in the process of dividing binary data into a plurality of binary strings with the length of 4, if the length of the last binary string obtained after division is less than 4, 0 can be used for supplementing the length of the last binary string to 4 in the low-bit of the last binary string, for example, if the length of the last binary string obtained after division is 01, 0 can be used for supplementing the last binary string to 0100, so that the length of the last binary string is 4, and thus, the length of each binary string in the subsequent processing process can be kept consistent.
Step S102, a first route map corresponding to each binary string is respectively determined according to the first corresponding relation table.
The first correspondence table includes correspondence between binary strings and a first route map, the first route map includes routes passing through 4 vertexes arranged in a 2×2 manner, and the routes point from a start vertex to a stop vertex and pass through each vertex only once.
Fig. 2 is a schematic diagram of a first route graph according to an embodiment of the present application, where, as shown in fig. 2, a route in the first route graph passes through all vertices thereof, and passes through each vertex 1 time, starting from a start stage and ending at a stop vertex, and, as shown in fig. 3, when the same vertex is used as a start vertex, there are 6 different first route graphs in total according to different specific routes thereof, and in addition, each vertex of 4 vertices in the first route graph can be used as a start vertex, so that the first route graph has 24 types at most.
For the binary string divided in step S101, since the length thereof is 4, so that it has at most 2 x 2 = 16 different binary strings, and therefore, in the embodiment of the application, 16 types of first route patterns can be screened out from 24 types of first route patterns, each binary string corresponds to one type of first route pattern respectively, in the embodiment of the application, the corresponding relation between the binary string and the first route pattern is located in the first corresponding relation table, and an implementer can determine the specific corresponding relation between the binary string and the first route pattern in the first corresponding relation table according to the requirement.
In one embodiment, a specific corresponding relation can be generated randomly from specific corresponding relations between all possible first route patterns and binary strings, so as to obtain a first corresponding relation table, and the generated first corresponding relation table is used in a determination process of the first route patterns, and as the specific corresponding relation between the first route patterns and the binary strings has a factorial class of at most 16, information leakage can be further avoided.
In one embodiment, 8 types of binary strings with the frequency of the first 8 are used as high frequency binary strings according to the frequency of different types of binary strings with the length of 4, and binary numbers with other than the high frequency are used as low frequency binary strings, since there are 16 types of binary strings with the length of 4 at most, and the types of the first route patterns are 24 at most; therefore, each high-frequency binary string can respectively correspond to 2 different first route patterns in the first corresponding relation table, each low-frequency binary string respectively corresponds to 1 first route pattern in the first corresponding relation table, and the first route patterns corresponding to all binary strings are different; in the process of determining the first route patterns corresponding to each high-frequency binary string, randomly selecting from 2 first route patterns corresponding to each high-frequency binary string; therefore, the type of the first route map corresponding to the binary string with higher frequency is not unique, so that the difficulty of cracking through statistics is increased, the influence of the binary string with higher frequency on the integrity of the data to be processed is larger, and the safety of the data to be processed is further guaranteed.
Step S103, obtaining a second route pattern taking the ending vertex of the first route pattern as the starting vertex.
The second route map comprises routes passing through 4 vertexes in a 2×2 arrangement, the routes point from a start vertex to a stop vertex and pass through each vertex only once, and the width of a third route map formed by combining the first route map and the second route map is 3 and the height of the third route map is 3.
As shown in fig. 4, the initial vertex of the second route pattern corresponding to the first route pattern coincides with the path of the first route pattern, and at the same time, the width and the height of the third route pattern formed by combining the first route pattern and the second route pattern are limited to 3, so as to avoid overlapping of the paths in the first route pattern and the second route pattern, thereby obtaining a third route pattern with continuous routes, so that the encrypted binary string is determined according to the specific type of the third route pattern in the subsequent step.
Since the second route patterns obtained by the same initial vertex are 6 types, the first route patterns are at most 24 types, and the first route patterns under each type are at most 6 corresponding second route patterns, in the process of determining the second route patterns, random selection is performed from the 6 second route patterns corresponding to the first route patterns, and therefore, the safety of the subsequently obtained processed data can be further improved through the structures of the first route patterns and the second route patterns.
Step S104, the encrypted binary strings corresponding to each third route diagram are respectively determined according to the second corresponding relation table, and all the encrypted binary strings are arranged in sequence to obtain processed data.
The second corresponding relation table comprises corresponding relations between different types of third route patterns and different encrypted binary strings.
On the premise of determining the third route pattern, the encrypted binary string corresponding to the third route pattern can be obtained according to the second corresponding relation table in the embodiment of the application, and meanwhile, an implementer can determine the specific corresponding relation between the third route pattern and the encrypted binary string in the second corresponding relation table according to actual requirements.
In one embodiment, a specific correspondence may also be randomly generated from specific correspondences between all possible third route patterns and encrypted binary strings, so as to obtain a second correspondence table, and the generated second correspondence table is used in the determination process of the encrypted binary strings, since the first route patterns have at most 24 types, and at most 6 corresponding second route patterns are provided for the first route patterns under each type, and at the same time, there are no repeated parts of the lines limited by the first route patterns and the second route patterns, so that the obtained third route patterns are distributed approximately along any one of two diagonal lines of the 3×3 region, so that at most 6×6×2×2=144 third route patterns are provided, so that the specific correspondence between the third route patterns and the encrypted binary strings is at most 144-! That is, the factorial species can further avoid the slope of the information by randomly generating the second correspondence table in advance.
In the embodiment of the application, the same second corresponding relation table is adopted for the binary strings with different lengths of 4, so that the confusion of the obtaining process of the encrypted binary strings corresponding to different binary strings is avoided, and meanwhile, the generated second corresponding relation table can be encrypted by adopting a symmetric encryption algorithm and used after decryption before use, so that the leakage of the second corresponding relation table can be further prevented.
In one embodiment, since 144 types of third route patterns may exist in total, and the length of the binary number with the length of 8 is 256, 144 types of binary numbers can be randomly determined from the 256 binary numbers with the length of 8 to form the second correspondence table in the embodiment of the present application, and meanwhile, an implementer may select a binary number with a larger length to determine the correspondence, but a binary number with a larger length tends to bring a larger calculation amount, so that the embodiment of the present application is illustrated by a binary number with the length of 8.
In another embodiment, since there may be 144 types of third route patterns in total and the length of binary numbers of length 7 is 128 types in total, while there are 16 types of binary numbers of length 4 and 128+16=144, it is possible to correspond 128 types of third route patterns among the 128 types of third route patterns to the encrypted binary string of length 7 while the remaining 16 types of third route patterns are to the encrypted binary string of length 4, so that the length of the encrypted binary string corresponding to the binary string obtained after division is not fixed while the amount of calculation required is less than that of determining 144 types from 256 types, and it is ensured that the third route patterns of each type have their unique corresponding encrypted binary string.
In addition, in the case that two types of lengths of encrypted binary strings exist, as binary codes are adopted, in order to avoid confusion of segment interception lengths in the subsequent restoration process, different identifiers can be inserted before the encrypted binary strings with different lengths, the encrypted binary strings after the identifiers are inserted are used as new encrypted binary strings, wherein the identifiers are 1 or 0, taking the encrypted binary strings with the lengths of 4 or 7 as an example in the embodiment of the application, 1 can be inserted before the encrypted binary strings with the lengths of 4 as the identifiers, and 0 can be inserted before the encrypted binary strings with the lengths of 7 as the identifiers; alternatively, 1 is inserted as an identifier before an encrypted binary string of length 7, and 0 is inserted as an identifier before an encrypted binary string of length 4.
Meanwhile, the implementer may also adopt other manners, so that two types of lengths of the encrypted binary strings exist, for example, since the binary strings with the length of 6 have 64 types in total, 144-64=80, and then determine 80 different types of binary strings from the binary strings with the length of 7 as the encrypted binary strings, and participate in the construction of the second correspondence table.
144 kinds of binary numbers with the length of 8 can be randomly determined from the 256 binary numbers to form a second corresponding relation table in the embodiment of the application, and an implementer can select binary numbers with larger lengths to determine the corresponding relation, but the binary numbers with larger lengths bring larger calculation amount, so that the embodiment of the application is exemplified by the binary numbers with the length of 8.
Finally, after the encrypted binary strings corresponding to each divided binary string are obtained respectively, all the encrypted binary strings can be arranged in sequence to obtain processed data, so that the processed data capable of covering the plaintext information is obtained, and the safety of the data is ensured.
Referring to fig. 5, the process of encrypting a binary string corresponding to a binary string with a length of 4 after division is illustrated, first, a first route pattern corresponding to a binary string with a length of 4 after division is determined according to a first correspondence table, in this example, a binary string 0011 corresponds to the first route pattern in fig. 5, then, one of 6 possible second route patterns with the initial vertex of the point position is selected by using the final vertex of the first route pattern as the initial vertex, the first route pattern and the second route pattern are spliced to obtain a third route pattern, and in this example, the encrypted binary string corresponding to the third route pattern in the second correspondence table is 1010100.
In one embodiment, the generated key may be used to encrypt the processed data with AES, where AES (Advanced Encryption Standard ) is a common encryption algorithm, and it should be noted that, in encrypting the plaintext with AES, the packet length of the plaintext is only 128 bits, that is, each packet is 16 bytes, where each byte is 8 bits.
Meanwhile, the length of the key in the AES encryption process can be 128 bits, 192 bits or 256 bits, wherein the lengths of the keys are different, the adopted encryption round numbers are also different, and specifically, when the length of the key is 128 bits, the encryption times are 10; alternatively, when the length of the key is 192 bits, the number of encryption times is 12; alternatively, when the length of the key is 256 bits, the number of encryption times is 14.
The AES encryption process comprises the steps of dividing a plaintext into a plurality of plaintext blocks with 128 bits in length, carrying out multiple rounds of complex encryption processing on each plaintext block by using a secret key to obtain a plurality of independent ciphertext blocks, splicing the ciphertext blocks together to obtain a final encryption result, and concretely, carrying out byte substitution, row displacement, column confusion and round secret key addition on the plaintext blocks in sequence to obtain encrypted ciphertext blocks.
Note that byte Substitution (Sub Bytes) is an operation of searching for each individual element in the state matrix in a Substitution-box (S-box) and replacing the input state with this. Byte substitution is a reversible nonlinear transformation, and is also the only nonlinear transformation in the AES operation set. Byte substitution is also accomplished by reverse transpose box lookup and substitution. The S box is a pre-designed lookup table with the size of 16x16, namely 256 elements are included, the S box is calculated strictly according to the design principle, so that the safety of an algorithm is ensured, and meanwhile, bytes after byte replacement can be obtained more conveniently and rapidly through the S box lookup operation.
The row shift is a simple left cyclic shift operation. When the key length is 128 bits, the 0 th row of the state matrix is shifted left by 0 byte, the 1 st row is shifted left by 1 byte, the 2 nd row is shifted left by 2 bytes, the 3 rd row is shifted left by 3 bytes, and the row displacement of each row is completed accordingly. The column mixing transformation is realized by matrix multiplication, and the state matrix after the row shift is multiplied by a fixed matrix to obtain a state matrix after confusion.
In the Round Key addition (Add Round Key) transformation, a 128-bit State matrix is bitwise xored with a 128-bit subkey, which can be regarded as 4 bytes in a column of the State matrix being xored with one byte of the Round Key, and also as byte xored between the two.
In one embodiment, the key may be combined to decrypt the encrypted data of the processed data encrypted using AES, wherein the process of AES decryption is an inverse transform of AES encryption, and then obtain the decrypted processed data.
In one embodiment, the processed data may be restored, so as to obtain binary data obtained by encoding the data to be processed in the cardiac functional treatment system, so as to obtain the data to be processed in the cardiac functional treatment system, which may specifically include the following: under the condition that two lengths of encrypted binary strings exist, determining the length of the intercepted encrypted binary strings according to the first character of the processed data, and completing the interception of all the encrypted binary strings in sequence; then, as shown in fig. 6, a third route diagram corresponding to the encrypted binary string may be intercepted according to the second correspondence table; according to the third route diagram corresponding to the intercepted encrypted binary string, a second route diagram corresponding to the intercepted encrypted binary string can be determined, and a binary string with the length of 4 corresponding to the second route diagram is determined according to the first corresponding relation table so as to obtain a binary string corresponding to the intercepted encrypted binary string; finally, after the obtaining of the divided binary strings corresponding to each intercepted encrypted binary string is completed, the binary strings corresponding to each encrypted binary string can be arranged according to the intercepting sequence of the encrypted binary strings, and the arranged binary data are obtained; in this way, a reduction of binary data encoded from the data to be processed in the cardiac functional therapy system can be achieved.
In summary, the present application provides a data management method of an intelligent cardiac function therapeutic system, by dividing data to be processed into binary strings, respectively obtaining a first route pattern corresponding to each binary string, and determining a second route pattern corresponding to each binary string according to the first route pattern, so as to form a third route pattern from the first route pattern and the second route pattern, thereby using an encrypted binary string corresponding to the third route pattern as an encrypted binary string corresponding to the divided binary string, so that the connection between the encrypted binary string and the divided binary string is disturbed, and due to the existence of multiple types of the first route pattern and the second route pattern in the encryption process, the encryption degree of the obtained processed data is further improved, high confidentiality is ensured, and data leakage in the intelligent cardiac function therapeutic system can be effectively avoided.
In this disclosure, terms such as "comprising," "including," "having," and the like are open-ended terms that mean "including, but not limited to," and are used interchangeably therewith. The terms "or" and "as used herein refer to and are used interchangeably with the term" and/or "unless the context clearly indicates otherwise. The term "such as" as used herein refers to, and is used interchangeably with, the phrase "such as, but not limited to.
It should also be noted that in the methods and systems of the present application, components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered equivalent to the present disclosure.
The above examples are given for clarity of illustration only and are not to be construed as limiting the scope of the application. Other variations or modifications of the various aspects will be apparent to persons skilled in the art from the foregoing description, and it is not necessary nor intended to be exhaustive of all embodiments. All designs that are the same or similar to the present application are within the scope of the present application.
Claims (8)
1. A method for data management of an intelligent cardiac functional therapy system, comprising:
encoding data to be processed in the cardiac functional therapy system into binary data, and dividing the binary data into a plurality of binary strings with the length of 4;
respectively determining a first route diagram corresponding to each binary string according to a first corresponding relation table, wherein the first corresponding relation table comprises the corresponding relation between the binary string and the first route diagram, the first route diagram comprises routes passing through 4 vertexes arranged in a 2 multiplied by 2 way, and the routes are directed to a termination vertex from a start vertex and only pass through each vertex once;
obtaining a second route map taking a termination vertex of the first route map as a start vertex, wherein the second route map comprises routes passing through 4 vertices arranged in a 2 multiplied by 2 way, the routes point to the termination vertex from the start vertex and pass through each vertex only once, and the width and the height of a third route map formed by combining the first route map and the second route map are 3;
the method comprises the steps of respectively determining encrypted binary strings corresponding to each third route pattern according to a second corresponding relation table, and sequentially arranging all the encrypted binary strings to obtain processed data, wherein the second corresponding relation table comprises corresponding relations between different types of third route patterns and different encrypted binary strings;
two encrypted binary strings with different lengths exist in all the encrypted binary strings corresponding to all the third route patterns;
inserting different identifiers in front of the encrypted binary strings with different lengths, and taking the encrypted binary strings with the identifiers inserted as new encrypted binary strings, wherein the identifiers are 1 or 0;
the number of the encrypted binary strings with the length of 7 in all the encrypted binary strings corresponding to the third route diagram is 128, and the number of the encrypted binary strings with the length of 4 is 16.
2. The method according to claim 1, wherein the method further comprises:
taking 8 binary strings with the largest frequency among all binary strings with the length of 4 as high-frequency binary strings;
taking the binary strings except the high frequency binary string in all the binary strings with the length of 4 as low frequency binary strings;
each high-frequency binary string corresponds to 2 different first route patterns in the first corresponding relation table, each low-frequency binary string corresponds to 1 first route pattern in the first corresponding relation table, and the first route patterns corresponding to all binary strings are different;
in the process of determining the first route patterns corresponding to each high-frequency binary string, randomly selecting from 2 first route patterns corresponding to each high-frequency binary string.
3. The method of claim 1, wherein the lengths of all encrypted binary strings corresponding to all third route patterns are the same.
4. The method of claim 1, wherein before determining the encrypted binary string corresponding to each third route pattern according to the second correspondence table, the method further comprises: and randomly generating a specific corresponding relation from the corresponding relations of all the third route patterns and the encrypted binary string to obtain a second corresponding relation table.
5. The method according to claim 4, wherein the method further comprises: and performing AES encryption on the processed data by using the generated key to obtain encrypted data.
6. The method of claim 5, wherein the method further comprises: and performing AES decryption on the encrypted data according to the secret key, and decrypting the processed data.
7. The method of claim 6, wherein after decrypting the processed data, the method further comprises:
determining the length of the intercepted encrypted binary string according to the first character of the processed data, and completing the interception of all the encrypted binary strings in turn;
respectively determining a third route diagram corresponding to each intercepted encrypted binary string according to the second corresponding relation table;
determining a second route pattern corresponding to the intercepted encrypted binary string according to a third route pattern corresponding to the intercepted encrypted binary string, and determining a binary string corresponding to the second route pattern according to the first corresponding relation table so as to obtain a binary string corresponding to the intercepted encrypted binary string;
and arranging the binary strings corresponding to each encrypted binary string according to the sequence of intercepting the encrypted binary strings to obtain arranged binary data.
8. The method according to any one of claims 1 to 7, wherein in dividing binary data into a plurality of binary strings of length 4, the method further comprises: if the length of the last binary string obtained after division is less than 4, the length of the last binary string is supplemented by 0 in the low bit of the last binary string to be supplemented to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211028784.XA CN115396092B (en) | 2022-08-26 | 2022-08-26 | Data management method of intelligent cardiac function treatment system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211028784.XA CN115396092B (en) | 2022-08-26 | 2022-08-26 | Data management method of intelligent cardiac function treatment system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115396092A CN115396092A (en) | 2022-11-25 |
| CN115396092B true CN115396092B (en) | 2023-09-12 |
Family
ID=84123332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211028784.XA Active CN115396092B (en) | 2022-08-26 | 2022-08-26 | Data management method of intelligent cardiac function treatment system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115396092B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103532701A (en) * | 2013-10-16 | 2014-01-22 | 南通纺织职业技术学院 | Encryption and decryption method for numeric type data |
| CN103684760A (en) * | 2012-09-24 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method, device and system for encryption and decryption of communication |
| CN104038232A (en) * | 2014-05-09 | 2014-09-10 | 安庆师范学院 | Testing data compression and decompression method based on secondary exclusive-or operation |
| CN105281894A (en) * | 2015-11-25 | 2016-01-27 | 深圳供电局有限公司 | Plaintext encryption method and system based on seven-order magic cube |
| CN106649425A (en) * | 2016-08-01 | 2017-05-10 | 中国地质大学（武汉） | Spatial-contiguity-considered vector space data coding method |
| CN109903212A (en) * | 2019-01-28 | 2019-06-18 | 郑州轻工业学院 | A kind of image encryption method based on H Geometric Fractal and Hilbert curve |
| CN111698252A (en) * | 2020-06-11 | 2020-09-22 | 邦尼集团有限公司 | Cloud platform data encryption transmission method and system |
| CN114745096A (en) * | 2022-04-13 | 2022-07-12 | 南通大学 | Character string encryption method based on layered bidirectional diffusion |
| CN114900287A (en) * | 2022-05-16 | 2022-08-12 | 浙江吉利控股集团有限公司 | Road network-based encryption method, device, equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| RU2659025C1 (en) * | 2017-06-14 | 2018-06-26 | Общество с ограниченной ответственностью "ЛЭНДИГРАД" | Methods of encoding and decoding information |
| US20210279341A1 (en) * | 2020-03-05 | 2021-09-09 | Timothy Arthur Huck | Cryptographic security system, method, and program product using data partitioning |
-
2022
- 2022-08-26 CN CN202211028784.XA patent/CN115396092B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103684760A (en) * | 2012-09-24 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method, device and system for encryption and decryption of communication |
| CN103532701A (en) * | 2013-10-16 | 2014-01-22 | 南通纺织职业技术学院 | Encryption and decryption method for numeric type data |
| CN104038232A (en) * | 2014-05-09 | 2014-09-10 | 安庆师范学院 | Testing data compression and decompression method based on secondary exclusive-or operation |
| CN105281894A (en) * | 2015-11-25 | 2016-01-27 | 深圳供电局有限公司 | Plaintext encryption method and system based on seven-order magic cube |
| CN106649425A (en) * | 2016-08-01 | 2017-05-10 | 中国地质大学（武汉） | Spatial-contiguity-considered vector space data coding method |
| CN109903212A (en) * | 2019-01-28 | 2019-06-18 | 郑州轻工业学院 | A kind of image encryption method based on H Geometric Fractal and Hilbert curve |
| CN111698252A (en) * | 2020-06-11 | 2020-09-22 | 邦尼集团有限公司 | Cloud platform data encryption transmission method and system |
| CN114745096A (en) * | 2022-04-13 | 2022-07-12 | 南通大学 | Character string encryption method based on layered bidirectional diffusion |
| CN114900287A (en) * | 2022-05-16 | 2022-08-12 | 浙江吉利控股集团有限公司 | Road network-based encryption method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115396092A (en) | 2022-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20240045670A1 (en) | Obfuscation for protection of streaming media and other data flows | |
| US10009170B2 (en) | Apparatus and method for providing Feistel-based variable length block cipher | |
| TWI418197B (en) | Encryption protection method | |
| CN105871550B (en) | A kind of system for realizing digital signal encryption transmission | |
| US8391476B2 (en) | Masking method of defending differential power analysis attack in seed encryption algorithm | |
| KR101324351B1 (en) | Method for generating a cipher-based message authentication code | |
| US20070053516A1 (en) | Symmetric key encryption system with synchronously updating expanded key | |
| DE60316586T2 (en) | EFFICIENT ARITHMETIC IN GALOIS FIELDS OF UNGERADER CHARACTERISTICS ON BINARY HARDWARE | |
| NZ572949A (en) | Encrypting a plaintext message with authentication | |
| CN108900511A (en) | A kind of method, device and equipment of file encryption and decryption | |
| Alsaidi et al. | Compression multi-level crypto stego security of texts utilizing colored email forwarding | |
| Iqbal et al. | DNA strands level scrambling based color image encryption scheme | |
| WO2018192399A1 (en) | Sequence encryption method accompanying adjustable random reconfiguration of key | |
| CN105871549A (en) | Digital signal encryption processing method | |
| Lui et al. | Chaos-based joint compression and encryption algorithm for generating variable length ciphertext | |
| CN116418481A (en) | Text privacy data double encryption protection method, device and equipment | |
| Forler et al. | Overview of the Candidates for the Password Hashing Competition: And Their Resistance Against Garbage-Collector Attacks | |
| Jasra et al. | Image encryption techniques: A review | |
| CN115396092B (en) | Data management method of intelligent cardiac function treatment system | |
| Quilala et al. | Modified blowfish algorithm | |
| Mastan et al. | A color image encryption technique based on a substitution-permutation network | |
| Cayrel et al. | Secure implementation of the stern authentication and signature schemes for low-resource devices | |
| CN105049176B (en) | Decryption method for view data safe transmission | |
| CN107592963A (en) | Calculated with secret value | |
| CN115333777A (en) | Data encryption method, system, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |