CN115643110B - Application software safety detection method based on running data - Google Patents
Application software safety detection method based on running data Download PDFInfo
- Publication number
- CN115643110B CN115643110B CN202211653725.1A CN202211653725A CN115643110B CN 115643110 B CN115643110 B CN 115643110B CN 202211653725 A CN202211653725 A CN 202211653725A CN 115643110 B CN115643110 B CN 115643110B
- Authority
- CN
- China
- Prior art keywords
- scanning
- sub
- dimensional matrix
- subsequence
- sequence
- 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
Images
Abstract
The invention relates to the field of data processing for data security protection, in particular to an application software security detection method based on running data, which comprises the following steps: converting all data information into each fixed-length binary coding sequence; acquiring each sub two-dimensional matrix and a scanning mode thereof; acquiring an original sequence and each scanning subsequence of each sub two-dimensional matrix; obtaining the optimal degree of each scanning starting point according to the ectopic degree and the homothetic dispersion degree between each scanning subsequence of each sub two-dimensional matrix and the corresponding original sequence, further obtaining the optimal scanning starting point and the optimal scanning sequence of each sub two-dimensional matrix, and further obtaining ciphertext data; and in the process that the user accesses the application software by using the ciphertext data, carrying out safety detection on the application software according to whether the application software runs abnormally or not when the data is operated. The invention can not only destroy the statistical characteristics of the plaintext data, but also can not increase the data amount additionally, thereby ensuring the privacy and ensuring the data compression ratio.
Description
Technical Field
The invention relates to the field of data processing for data security protection, in particular to an application software security detection method based on running data.
Background
With the rapid development of informatization, data becomes an information center, the data contains a large amount of sensitive information, such as privacy information of a user, when the user runs application software, the software often reads personal information to perform identity verification, but the software serving as a third-party platform often has an untrusted risk, if the application software steals the personal private information, personal and property safety of the user is easily caused, so that when the user accesses the application software, the user information needs to be encrypted, and if the detected application software tries to crack ciphertext data of the personal information, the software has higher risk and lower safety and needs to be rectified.
The traditional data encryption method generally adopts a scrambling method to encrypt data, and the relevance among the data is damaged by changing the position of the data, so as to achieve the aim of hiding the plaintext. The scrambling encryption only changes the position of data, the statistical characteristics of the data are not damaged, the encryption effect is poor, and malicious software is easy to crack and steal private information of a user when being cracked.
Disclosure of Invention
The invention provides an application software safety detection method based on running data, which aims to solve the existing problems.
The application software safety detection method based on the running data adopts the following technical scheme:
one embodiment of the invention provides an application software safety detection method based on running data, which comprises the following steps:
collecting data information, and converting all the collected data information into each fixed-length binary coding sequence;
constructing a two-dimensional matrix according to each fixed-length binary coding sequence; the two-dimensional matrix is subjected to blocking processing to obtain each sub two-dimensional matrix; determining the scanning mode of each sub two-dimensional matrix according to the number of the alternative scanning modes;
acquiring each scanning starting point corresponding to the scanning mode of each sub two-dimensional matrix; acquiring an original sequence of each sub two-dimensional matrix; scanning each sub two-dimensional matrix according to the scanning mode of each sub two-dimensional matrix and each scanning starting point to obtain each scanning subsequence of each sub two-dimensional matrix, wherein each scanning starting point corresponds to one scanning subsequence; obtaining the ectopic degree of each scanning subsequence and the homothetic dispersion of each scanning subsequence according to the binary number of each scanning subsequence of each sub two-dimensional matrix and the corresponding position of the original sequence of each sub two-dimensional matrix; obtaining the optimal degree of each scanning starting point according to the ectopic degree and the homothetic dispersion degree corresponding to each scanning subsequence of each sub two-dimensional matrix; obtaining the optimal scanning starting point of each sub two-dimensional matrix according to the optimal degree of each scanning starting point; scanning each sub two-dimensional matrix according to the scanning mode of each sub two-dimensional matrix and the optimal scanning starting point to obtain an optimal scanning sequence of each sub two-dimensional matrix; obtaining ciphertext data according to the optimal scanning sequence of all the sub two-dimensional matrixes;
and in the process that the user accesses the application software by using the ciphertext data, carrying out safety detection and data protection on the application software according to whether the application software runs the data abnormally or not.
Preferably, the step of acquiring the scanning mode of each sub-two-dimensional matrix includes:
acquiring a random number sequence, and calculating products between each element value in the random number sequence and the number of the alternative scanning modes, wherein each product constitutes a random scanning mode sequence; and obtaining the scanning mode of each sub two-dimensional matrix by taking each element value in the random scanning mode sequence as the number of the corresponding scanning mode of each sub two-dimensional matrix.
Preferably, the ectopic degree of each scanning subsequence is obtained by:
and taking the total digits of different binary numbers at corresponding positions in each scanning subsequence of each sub-two-dimensional matrix and the original sequence of each sub-two-dimensional matrix as the ectopic degree of each scanning subsequence, and taking the ratio of the ectopic number of each scanning subsequence to the total number of elements contained in the corresponding sub-two-dimensional matrix as the ectopic degree of each scanning subsequence.
Preferably, the method for obtaining the parity dispersion of each scanning subsequence includes:
taking any one of the sub-two-dimensional matrixes as a target matrix; taking any one scanning subsequence of the target matrix as a target scanning subsequence, acquiring the same segments in the target scanning subsequence and an original sequence of the target matrix, wherein the same segments refer to data segments formed by continuous same binary numbers at corresponding positions in the traversing process of the original sequence and the scanning subsequence from left to right, calculating the average length of all the same segments, calculating the ratio of the average length to the total number of elements contained in the target matrix, and taking the difference between 1.0 and the obtained ratio as the homothetic dispersion of the target scanning subsequence; and processing each scanning subsequence of each sub two-dimensional matrix to obtain the homothetic dispersion of each scanning subsequence.
Preferably, the method for acquiring the preferred degree of each scanning starting point comprises: and calculating the product between the ectopic degree corresponding to each scanning sub-sequence and the parity dispersion, and taking the obtained product as the optimization degree of the scanning starting point corresponding to each scanning sub-sequence.
The invention has the beneficial effects that: the method comprises the steps of carrying out code conversion on data information to be encrypted, constructing a two-dimensional matrix, segmenting the two-dimensional matrix to obtain each sub two-dimensional matrix, and randomly setting a scanning mode of each sub two-dimensional matrix, so that the difference between a binary coding sequence generated by scanning and an original sequence is large enough to achieve the purpose of hiding plaintext data, and the random setting of the scanning mode increases the contingency of the scanning mode and improves the cracking difficulty; and then different scanning starting points are used, each sub two-dimensional matrix is scanned according to the scanning mode corresponding to each sub two-dimensional matrix, the optimal degree of each scanning starting point is obtained according to the obtained ectopic degree and the homothetic dispersion degree between each scanning subsequence and the original sequence of each sub two-dimensional matrix, and then the optimal scanning starting point and the optimal scanning sequence are obtained, so that on the basis of ensuring the greater ectopic degree, the better the chaotic position distribution of the changed binary number is, the better the statistical characteristic of plaintext data can be damaged, the data quantity cannot be additionally increased, the data compression ratio is ensured while the privacy is ensured, the user information is difficult to crack by malicious software, sufficient time is provided for software security judgment at the moment, and the software security detection and the data protection can be better performed.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flowchart illustrating steps of a method for detecting security of application software based on operating data according to the present invention;
FIG. 2 is a schematic diagram of a two-dimensional matrix of the application software security detection method based on the operation data according to the present invention;
fig. 3 is a schematic view of a sub-two-dimensional matrix of the application software security detection method based on the operation data according to the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention adopted to achieve the predetermined objects, the following detailed description, structures, features and effects of the method for detecting the safety of the application software based on the operation data according to the present invention are provided with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following describes a specific scheme of the application software security detection method based on the operating data in detail with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating steps of a method for detecting security of application software based on operating data according to an embodiment of the present invention is shown, where the method includes the following steps:
step S001: and collecting data information, and converting all the collected data information into each fixed-length binary coding sequence.
First, data information is collected, such as user information, application software information, and the like, taking the user information as an example, because the expression forms of the user information are different, it is difficult to effectively hide the user information when performing traditional scrambling encryption, and the user information is referred to as plaintext data in this embodiment.
In order to ensure the privacy of the user information and facilitate the uniform processing of data, in this embodiment, first, the user information is subjected to binary conversion, the user information in different expression forms is all converted into a binary coding form, and the computer also processes the binary data when storing the user information, where the code conversion may be performed by comparing an ASCII coding table, and because ASCII coding serial numbers corresponding to different characters in the user information are different, the length of the binary code after code conversion is not uniform, that is, the binary code obtained after conversion according to the ASCII coding table is a variable length code.
In order to facilitate data decryption and decompression, the variable length codes need to be unified into fixed length codes, and the code length of the binary code sequence obtained by converting each character in the user information is obtained, wherein the code length of the binary code sequence refers to the binary digit number contained in the binary code sequence; taking the maximum code length in all the binary code sequences as the basic length, and performing high bit complement 0 on each binary code sequence with the code length smaller than the basic length, for example, when the maximum code length in all the binary code sequences is 8, performing high bit complement 0 on each binary code sequence with the code length smaller than 8 until the code length of the binary code sequences becomes 8, such as: 100 high complement 0 to 00000100.
Step S002: constructing a two-dimensional matrix according to each fixed-length binary coding sequence; acquiring each sub two-dimensional matrix; and determining the scanning mode of each sub two-dimensional matrix according to the number of the alternative scanning modes.
The binary coding sequence is a sequence formed by binary numbers 0 and 1, if the relevance between the binary numbers 0 and 1 is damaged, the corresponding plaintext data can also change, although the adjacent binary numbers 0 and 1 in the binary coding sequence have strong relevance, the binary coding sequence is read according to a fixed sequence from left to right, and therefore, each binary number in the binary coding sequence is only relevant to the adjacent number; if a plurality of fixed-length binary coding sequences are converted into a two-dimensional matrix, each binary number in the two-dimensional matrix is an element of the two-dimensional matrix, each element is associated with other elements in eight neighborhoods of the element, and if a proper scanning mode is selected in a self-adaptive manner according to the distribution condition of 0 and 1 binary numbers in the two-dimensional matrix, the difference between a sequence obtained after scanning and an original binary coding sequence is large enough, so that the association between ciphertext data and plaintext data obtained by the scanning is greatly reduced, and the privacy of user information is ensured.
Recording the number of characters of user information as M, the basic length of each character as N, arranging the fixed-length binary coding sequences corresponding to the characters according to the sequence of the characters to obtain a sequence called a one-dimensional binary sequence, wherein the total number of binary numbers of 0 and 1 contained in the one-dimensional binary sequence is M
Converting the one-dimensional binary coding sequence into a two-dimensional matrix, wherein the initial side length of the two-dimensional matrix is
In which
Represents rounding up;
the two-dimensional matrix is divided into a plurality of sub two-dimensional matrices, and in order to ensure that the sub two-dimensional matrices have the same size, the initial side length of the two-dimensional matrix is required to be ensured not to be a prime number, so that when the initial side length of the obtained two-dimensional matrix is not a prime number, the initial side length of the two-dimensional matrix is taken as the final side length of the two-dimensional matrix; when the initial side length of the obtained two-dimensional matrix is a prime number, the operation of adding 1 to the initial side length is needed, that is, a junction of which the initial side length is added by 1 is obtainedThe result is the final side length of the two-dimensional matrix, i.e. the final side length of the two-dimensional matrix is L, from which a size of L is constructed
A two-dimensional matrix of sizes. Will have a length of
The binary numbers in the one-dimensional binary sequence are sequentially filled into the two-dimensional matrix, if the two-dimensional matrix has vacant positions after all the 0 and 1 digits in the one-dimensional binary sequence are filled, 0 is supplemented, so that each position in the two-dimensional matrix has a digit of 0 or 1, and the schematic diagram of the obtained two-dimensional matrix is shown in fig. 2.
The constructed two-dimensional matrix is subjected to block processing, namely, the two-dimensional matrix is divided into
Each size is
Wherein L = a × L, wherein
And
all positive integers are positive integers, namely L is decomposed into a product form of two positive integers, so that a plurality of combination forms are obtained, any one positive integer in one combination mode is selected as a value, and the other positive integer in the combination mode is the side length of the sub two-dimensional matrix; as shown in FIG. 3, FIG. 3 is a schematic view of a display device
，
In the process, the two-dimensional matrix in fig. 2 is partitioned to obtain a sub two-dimensional matrix schematic diagram, and in fig. 3, from left to right, the first, second, third, and four sub two-dimensional matrices are sequentially arranged from top to bottom.
The distributions of 0 and 1 in each sub-two-dimensional matrix are different, so that the converted ciphertext data has a larger privacy degree, and different scanning modes are selected for scanning, wherein the common scanning mode is as follows: zigzag scanning, helical scanning, hilbert scanning, peano scanning, and the like. The alternative scanning modes are numbered from 1, and the alternative scanning modes set by the present embodiment include: four scanning modes, such as Z-shaped scanning, spiral scanning, hilbert scanning and Piano scanning, are adopted, and numbers corresponding to the four scanning modes are 1, 2, 3 and 4, so that the maximum value of the numbers is the number of the alternative scanning modes and is marked as Z;
generating a random scanning mode sequence according to the alternative scanning mode, wherein the random scanning mode sequence can be generated by a chaotic sequence,
the mapping is a typical chaotic mapping, and the model is as follows:
wherein
Is a parameter that can be controlled by the user,
representing the nth number in the chaotic sequence. When mu satisfies
When the system enters a chaotic state, each element generated belongs to
A chaotic sequence in between;
will be provided with
The chaotic mapping model is iterated m times, wherein
Obtaining a product of
Chaotic sequence of each element, and the number of each element and alternative scanning modes of the chaotic sequence
Multiply and round down to obtain the interval range of
For example, the random scanning mode sequences are 2, 3, 1, and 2, and the corresponding scanning modes are respectively spiral scanning, hilbert scanning, zigzag scanning, and spiral scanning, that is, the scanning mode of the first sub two-dimensional matrix is spiral scanning, the scanning mode of the second sub two-dimensional matrix is hilbert scanning, the scanning mode of the third sub two-dimensional matrix is zigzag scanning, and the scanning mode of the fourth sub two-dimensional matrix is spiral scanning.
Step S003: acquiring an original sequence and each scanning subsequence of each sub two-dimensional matrix; acquiring the ectopic degree and the parity dispersion between each scanning subsequence of each sub two-dimensional matrix and the corresponding original sequence to obtain the optimal degree of each scanning starting point; and obtaining the optimal scanning starting point and the optimal scanning sequence of each sub two-dimensional matrix according to the optimal degree of each scanning starting point, and further obtaining the ciphertext data.
Starting points of scanning modes such as Z-shaped scanning, hilbert scanning and Piano scanning are in four conditions, namely four elements corresponding to the upper left corner, the upper right corner, the lower left corner and the lower right corner of the sub-two-dimensional matrix, namely a first element and a last element of a first row in the sub-two-dimensional matrix and a first element and a last element of a last row in the two-dimensional matrix, namely each sub-two-dimensional matrix corresponds to four scanning starting points;
for the spiral scanning, when the side length of the sub-two-dimensional matrix is an even number, the four elements at the middle of the sub-two-dimensional matrix are taken as scanning starting points, and at this moment, the four scanning starting points are respectively in the sub-two-dimensional matrix, and the coordinates are
)、
)、
) Four elements of (1); when the side length of the sub two-dimensional matrix is odd, the element at the middle of the sub two-dimensional matrix is taken as a scanning starting point, and the coordinate of the scanning starting point in the sub two-dimensional matrix is taken as
) At this time, scanning is started from the scanning starting point, and clockwise scanning is performed by taking four scanning directions of 0 degree, 90 degrees, 180 degrees and 270 degrees as starting directions respectively;
that is, all the alternative scanning modes in this embodiment correspond to four cases, and when there are four scanning start points, the four cases respectively correspond to one scanning start point; when there are no four scanning start points, the four cases correspond to one scanning direction, respectively.
The scanning starting points are different, and the sequences obtained by final scanning are different, and in this embodiment, it is expected that the difference between the scanning sub-sequences obtained by scanning each sub-two-dimensional matrix in different scanning modes and the original sequences of each sub-two-dimensional matrix is large enough, where the original sequences of each sub-two-dimensional matrix are binary sequences obtained by traversing the elements in each sub-two-dimensional matrix from left to right and from top to bottom; therefore, the degrees of preference of different scan start points are different, so that the degrees of preference of four scan start points need to be calculated to select the optimal scan start point, and for the first sub-two-dimensional matrix in fig. 3, the degree of preference of the first scan start point is the same
Can be expressed as:
in the formula
The optimal degree of the 1 st scanning starting point is represented, s represents the number of different digits in the scanning subsequence and the original sequence, namely the total number of digits of different binary numbers at corresponding positions in the scanning subsequence and the original sequence which are obtained according to the scanning mode corresponding to the sub two-dimensional matrix from the first scanning starting point; for example, the original sequence of the sub-two-dimensional matrix is 1110000100000110, the scanning mode of the sub-two-dimensional matrix is spiral scanning, the scanning subsequence obtained after scanning is started from the first scanning starting point is 0000001110100110, wherein 6 bits in the obtained scanning subsequence are different from binary numbers at positions corresponding to the original sequence, and then the scanning subsequence is scanned in a spiral scanning mode, and the scanning mode is a scanning mode
；
q represents the number of the same segments in the original sequence and the scanning subsequence of the sub two-dimensional matrix;
representing the length of the ith same segment, wherein the same segment is a data segment formed by continuous same binary numbers at corresponding positions in the traversing process from left to right of the original sequence and the scanning subsequence; for example, when the original sequence is 1110000100000110, and the scanning sub-sequence is 0000001110100110, there are 4 identical segments, the first identical segment is "000" from the 4 th bit to the 6 th bit in the original sequence and the scanning sub-sequence, the second identical segment is "1" from the 8 th bit in the original sequence and the scanning sub-sequence, the third identical segment is "0" from the 10 th bit in the original sequence and the scanning sub-sequence, and the fourth identical segment is "00110" from the 12 th bit to the 16 th bit in the original sequence and the scanning sub-sequence, and the lengths of these identical segments are divided into parts3, 1, 5, respectively;
the more bits of the scanning subsequence which are different from the binary numbers at the corresponding positions of the original sequence, the larger the difference between the sequence generated by scanning and the original sequence is, if the bits of the different binary numbers at the corresponding positions are 0, namely the scanning subsequence which is obtained at the moment is the same as the original sequence, the invalid encryption is performed, therefore, the total bits s of the different binary numbers at the corresponding positions between the scanning subsequence and the original sequence can be used as the judgment index of the preference degree of the first scanning starting point, and the judgment index is used
Normalizing s;
And calculating the optimal degree of each scanning starting point of the sub two-dimensional matrix, selecting the scanning starting point with the highest optimal degree as the optimal scanning starting point, scanning the sub two-dimensional matrix according to the scanning mode of the sub two-dimensional matrix and the optimal scanning starting point to obtain a corresponding scanning subsequence, and calling the scanning subsequence as the optimal scanning sequence of the sub two-dimensional matrix. In the same way, obtaining the optimal scanning sequence of other sub two-dimensional matrixes; arranging the optimal scanning sequences corresponding to all the sub two-dimensional matrixes according to the serial numbers of the sub two-dimensional matrixes to form a new one-dimensional binary coding sequence, segmenting the obtained new one-dimensional binary coding sequence according to the basic length, and performing coding reduction on the plurality of fixed-length binary codes obtained at the moment by contrasting an ASCII (American standard code for information interchange) coding table to obtain final ciphertext data.
The key in this embodiment is divided into an initial key and an auxiliary key, where the initial key includes parameters of a chaotic sequence
、
And the side length of the sub-two-dimensional matrix
The subkey is a scan start point key, and the subkey is a sequence number of a scan start point or a sequence number of a scan direction. The initial key is not transmitted together with the ciphertext data, the initial key is managed independently and only known by a transmitting party and a receiving party, and the auxiliary key is dynamically acquired in the encryption process and can be transmitted together with the ciphertext data or extracted and transmitted together with the initial key.
Step S004: and in the process that the user accesses the application software by using the ciphertext data, carrying out safety detection and data protection on the application software according to whether the application software runs abnormal data or not.
When the user uses the application software, the encrypted ciphertext data is used for accessing the application software, when the application software needs to acquire user information, a request password needs to be sent to the user, if the user agrees, the corresponding information can be acquired, and if the user disagrees, the corresponding information cannot be acquired. Meanwhile, the change situation of the running data of the application software is monitored, if the application software contains viruses, after the sent password stealing command is rejected, the running data of the application software is abnormal, such as the flow of the application software is increased suddenly or the access times are increased suddenly, namely, the viruses can translate the ciphertext data forcibly to cause the abnormal running data, at this moment, the safety of the application software is low, and the safety of the application software needs to be evaluated and virus is killed, or the data is backed up to ensure the data safety. In this embodiment, the decryption operation on the ciphertext data is the inverse operation of the encryption operation.
Through the steps, the safety detection of the application software is completed.
In the embodiment, the data information to be encrypted is subjected to code conversion to construct the two-dimensional matrix, the two-dimensional matrix is divided to obtain each sub two-dimensional matrix, and the scanning mode of each sub two-dimensional matrix is randomly set, so that the difference between the binary coding sequence generated by scanning and the original sequence is large enough to achieve the purpose of hiding plaintext data, and the random setting of the scanning mode increases the contingency of the scanning mode and improves the cracking difficulty; and then, different scanning starting points are used, each sub two-dimensional matrix is scanned according to the scanning mode corresponding to each sub two-dimensional matrix, the optimal degree of each scanning starting point is obtained according to the ectopic degree and the homothetic dispersion degree between each obtained scanning subsequence and the original sequence of each sub two-dimensional matrix, and then the optimal scanning starting point and the optimal scanning sequence are obtained, so that on the basis of ensuring the greater ectopic degree, the more chaotic position distribution of the changed binary number is better, the statistical characteristic of plaintext data can be damaged, the data volume cannot be additionally increased, the privacy is ensured, the data compression ratio is ensured at the same time, the user information is difficult to crack by malicious software, sufficient time is provided for software security judgment, and the software security detection and the data protection can be better performed.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (3)
1. The application software safety detection method based on the operation data is characterized by comprising the following steps:
collecting data information, and converting all the collected data information into each fixed-length binary coding sequence;
constructing a two-dimensional matrix according to each fixed-length binary coding sequence; the two-dimensional matrix is subjected to blocking processing to obtain each sub two-dimensional matrix; determining the scanning mode of each sub two-dimensional matrix according to the number of the alternative scanning modes;
acquiring each scanning starting point corresponding to the scanning mode of each sub two-dimensional matrix; acquiring an original sequence of each sub two-dimensional matrix; scanning each sub two-dimensional matrix according to the scanning mode of each sub two-dimensional matrix and each scanning starting point to obtain each scanning subsequence of each sub two-dimensional matrix, wherein each scanning starting point corresponds to one scanning subsequence; obtaining the ectopic degree of each scanning subsequence and the parity dispersion of each scanning subsequence according to the binary number of each scanning subsequence of each sub two-dimensional matrix and the corresponding position of the original sequence of each sub two-dimensional matrix; obtaining the optimal degree of each scanning starting point according to the ectopic degree and the parity dispersion degree corresponding to each scanning subsequence of each sub two-dimensional matrix; obtaining the optimal scanning starting point of each sub two-dimensional matrix according to the optimal degree of each scanning starting point; scanning each sub two-dimensional matrix according to the scanning mode of each sub two-dimensional matrix and the optimal scanning starting point to obtain an optimal scanning sequence of each sub two-dimensional matrix; obtaining ciphertext data according to the optimal scanning sequence of all the sub two-dimensional matrixes;
in the process that a user accesses application software by using the ciphertext data, performing security detection and data protection on the application software according to whether the application software runs abnormally or not when the data is operated;
the method for acquiring the ectopic degree of each scanning subsequence comprises the following steps:
taking the total digits of different binary numbers at corresponding positions in each scanning subsequence of each sub-two-dimensional matrix and the original sequence of each sub-two-dimensional matrix as the ectopic degree of each scanning subsequence, and taking the ratio of the ectopic number of each scanning subsequence to the total number of elements contained in the corresponding sub-two-dimensional matrix as the ectopic degree of each scanning subsequence;
the method for obtaining the parity dispersion of each scanning subsequence comprises the following steps:
taking any one of the sub-two-dimensional matrixes as a target matrix; taking any scanning subsequence of the target matrix as a target scanning subsequence, acquiring the same segments in the target scanning subsequence and the original sequence of the target matrix, wherein the same segments refer to data segments formed by continuous same binary numbers at corresponding positions in the traversing process of the original sequence and the scanning subsequence from left to right, calculating the average length of all the same segments, calculating the ratio of the obtained average length to the total number of elements contained in the target matrix, and taking the difference between 1.0 and the obtained ratio as the homothetic dispersion of the target scanning subsequence; and processing each scanning subsequence of each sub two-dimensional matrix to obtain the parity dispersion of each scanning subsequence.
2. The method for detecting the safety of the application software based on the operation data as claimed in claim 1, wherein the step of obtaining the scanning mode of each sub-two-dimensional matrix comprises:
acquiring a random number sequence, and calculating products between each element value in the random number sequence and the number of the alternative scanning modes, wherein each obtained product forms a random scanning mode sequence; and obtaining the scanning mode of each sub two-dimensional matrix according to the element values in the random scanning mode sequence as the number of the scanning mode corresponding to each sub two-dimensional matrix.
3. The method for detecting the safety of the application software based on the operation data as claimed in claim 1, wherein the preferred degree of each scanning starting point is obtained by: and calculating the product between the ectopic degree and the parity dispersion corresponding to each scanning sub-sequence, and taking the obtained product as the optimal degree of the scanning starting point corresponding to each scanning sub-sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211653725.1A CN115643110B (en) | 2022-12-22 | 2022-12-22 | Application software safety detection method based on running data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211653725.1A CN115643110B (en) | 2022-12-22 | 2022-12-22 | Application software safety detection method based on running data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115643110A CN115643110A (en) | 2023-01-24 |
| CN115643110B true CN115643110B (en) | 2023-03-10 |
Family
ID=84948138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211653725.1A Active CN115643110B (en) | 2022-12-22 | 2022-12-22 | Application software safety detection method based on running data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115643110B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115859366B (en) * | 2023-02-06 | 2023-05-09 | 青岛新比特电子科技有限公司 | Intelligent planning method for multisource cloud computing cluster data based on urban brain |
| CN115834887B (en) * | 2023-02-17 | 2023-05-23 | 济南霍兹信息科技有限公司 | Data compression storage method of computer system |
| CN116232565B (en) * | 2023-03-14 | 2024-01-05 | 深圳棠人科技有限公司 | Safe storage method for website user data |
| CN116415159B (en) * | 2023-06-12 | 2023-08-18 | 青岛市城市规划设计研究院 | Sponge city data management method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168483A (en) * | 2014-07-08 | 2014-11-26 | 大连民族学院 | Video compression method and system |
| CN108852510A (en) * | 2018-03-28 | 2018-11-23 | 黄少君 | A kind of data processing method and device |
| CN111105339A (en) * | 2019-12-23 | 2020-05-05 | 郑州轻工业大学 | Image encryption method based on multidimensional chaotic system and Joseph scrambling |
| CN113507355A (en) * | 2021-05-26 | 2021-10-15 | 中国电子技术标准化研究院 | Method, system and medium for encrypting and decrypting quantum image |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008113114A (en) * | 2006-10-30 | 2008-05-15 | Seiko Epson Corp | Printing device, printing device control program, printing device control method, image processor, image processing program, image processing method, and storage medium stored with the program |
| WO2017138831A1 (en) * | 2016-02-12 | 2017-08-17 | Huawei Technologies Co., Ltd. | Method and apparatus for scan order selection |
| CN107464283B (en) * | 2017-07-13 | 2020-11-10 | 广西我的科技有限公司 | Method and device for collecting, analyzing and processing three-dimensional spatial information |
| CN109903212B (en) * | 2019-01-28 | 2020-07-03 | 郑州轻工业学院 | Image encryption method based on H geometric fractal and Hilbert curve |
| CN109788285B (en) * | 2019-02-27 | 2020-07-28 | 北京大学深圳研究生院 | Context model selection method and device for quantization coefficient ending zone bit |
| CN111487654B (en) * | 2020-04-09 | 2021-01-05 | 清华大学 | Scanning method and system for satellite ground equipment to quickly search satellites |
-
2022
- 2022-12-22 CN CN202211653725.1A patent/CN115643110B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168483A (en) * | 2014-07-08 | 2014-11-26 | 大连民族学院 | Video compression method and system |
| CN108852510A (en) * | 2018-03-28 | 2018-11-23 | 黄少君 | A kind of data processing method and device |
| CN111105339A (en) * | 2019-12-23 | 2020-05-05 | 郑州轻工业大学 | Image encryption method based on multidimensional chaotic system and Joseph scrambling |
| CN113507355A (en) * | 2021-05-26 | 2021-10-15 | 中国电子技术标准化研究院 | Method, system and medium for encrypting and decrypting quantum image |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115643110A (en) | 2023-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115643110B (en) | Application software safety detection method based on running data | |
| Wang et al. | A novel chaotic algorithm for image encryption utilizing one-time pad based on pixel level and DNA level | |
| CN111105339B (en) | Image encryption method based on multidimensional chaotic system and Joseph scrambling | |
| CN105471575B (en) | Information encryption and decryption method and device | |
| CN108366181A (en) | A kind of image encryption method based on hyperchaotic system and multistage scramble | |
| CN115664858B (en) | Authentication data encryption and decryption system for network security | |
| CN115659409B (en) | Financial asset transaction data safe storage method | |
| CN111294481B (en) | Image encryption method based on self-updating transformation, double random three-dimensional matrix scrambling and DNA calculation | |
| CN112202545B (en) | Image encryption method based on Y-type filling curve and variable-step Joseph traversal | |
| CN115665340B (en) | Image encryption method in remote fault diagnosis system | |
| CN110879895A (en) | Color image block encryption algorithm based on hyperchaotic system and DNA sequence | |
| CN111988144B (en) | DNA one-time pad image encryption method based on multiple keys | |
| Lee et al. | Alignment-robust cancelable biometric scheme for iris verification | |
| CN115865431A (en) | Network security sharing method for private data | |
| CN115643001A (en) | Image encryption method and system based on bit plane and readable storage medium | |
| CN112769545B (en) | Image encryption method based on adjacent pixel Joseph transformation and Mealy state machine | |
| CN116720211B (en) | Dynamic monitoring data security encryption method for heart rehabilitation | |
| CN116071164B (en) | Digital asset tracing method based on blockchain management | |
| CN115879138B (en) | Lightweight data encryption method for chip | |
| WO2001061905A2 (en) | System and methods for encrypted execution of computer programs | |
| CN116405293B (en) | Data encryption storage method of safe operation and maintenance system | |
| CN116232565B (en) | Safe storage method for website user data | |
| CN113971296B (en) | ID fuzzification data processing system | |
| CN116320203B (en) | Data management system for intelligent operation and maintenance platform of hospital | |
| CN116880778B (en) | User privacy protection method based on regenerative coding and distributed storage |
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 |