CN116204910B - Plug-in hash encryption method, nonvolatile readable storage medium and electronic device - Google Patents
Plug-in hash encryption method, nonvolatile readable storage medium and electronic device Download PDFInfo
- Publication number
- CN116204910B CN116204910B CN202310464845.5A CN202310464845A CN116204910B CN 116204910 B CN116204910 B CN 116204910B CN 202310464845 A CN202310464845 A CN 202310464845A CN 116204910 B CN116204910 B CN 116204910B
- Authority
- CN
- China
- Prior art keywords
- matrix
- plug
- data
- hash encryption
- target
- 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
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 123
- 238000007781 pre-processing Methods 0.000 claims abstract description 5
- 239000011159 matrix material Substances 0.000 claims description 201
- 230000004927 fusion Effects 0.000 claims description 3
- 230000009466 transformation Effects 0.000 claims description 3
- 230000002708 enhancing effect Effects 0.000 claims 1
- 239000000523 sample Substances 0.000 claims 1
- 239000000758 substrate Substances 0.000 claims 1
- 230000008878 coupling Effects 0.000 abstract description 7
- 238000010168 coupling process Methods 0.000 abstract description 7
- 238000005859 coupling reaction Methods 0.000 abstract description 7
- 230000006870 function Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 6
- 238000005305 interferometry Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000007306 turnover Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 238000009795 derivation Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007499 fusion processing Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2107—File encryption
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Bioethics (AREA)
- Databases & Information Systems (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to the technical field of data encryption, and discloses a plug-in hash encryption method, a nonvolatile readable storage medium and electronic equipment. The method comprises the following steps: the method comprises the steps of obtaining source data, preprocessing the source data to obtain preprocessed source data, obtaining a preset encryption plug-in library, wherein the preset encryption plug-in library comprises at least two target hash encryption plug-ins, and calling at least one target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain encrypted data. According to the embodiment, at least two target hash encryption plugins can be placed in the preset encryption plugin library in advance, and corresponding target hash encryption plugins can be called from the preset encryption plugin library to perform certain entropy chaos-increasing hash operation on the preprocessed source data, the coupling degree between different target hash encryption plugins is low, the target hash encryption plugins can be plugged and unplugged, the adaptability of a hash encryption algorithm is improved, and users can customize algorithm encryption according to service requirements.
Description
Technical Field
The invention relates to the technical field of data encryption, in particular to a plug-in hash encryption method, a nonvolatile readable storage medium and electronic equipment.
Background
The secure hash algorithm (Secure Hash Algorithm, SHA algorithm) is widely applied to data encryption services such as digital signature, and the SHA algorithm can output a message digest with a fixed length according to source data with different lengths so as to verify the integrity and the specificity of the source data.
In the encryption process, the coupling degree between encryption steps of the existing SHA algorithm is high, and the encryption steps are closely related. In general, the entropy-increased chaos of the encrypted data and the encryption efficiency are in a negative correlation relationship, different service scenes have different requirements on the encryption system, some service scenes need encrypted data with higher entropy-increased chaos, some service scenes need high-efficiency encrypted data, but the existing equipment needs to call all encryption steps to encrypt the source data, so that the encryption optimization capability in practical application is easily reduced, and the capability of adapting to various encrypted scenes is poor.
Disclosure of Invention
An object of an embodiment of the present invention is to provide a pluggable hash encryption method, a storage medium, and an electronic device, which aim to solve the problem of poor adaptability of the existing SHA algorithm.
In a first aspect, an embodiment of the present invention provides a method for plug-in hash encryption, including:
acquiring source data, and preprocessing the source data to obtain preprocessed source data;
acquiring a preset encryption plug-in library, wherein the preset encryption plug-in library comprises at least two target hash encryption plug-ins;
and calling at least one target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain encrypted data.
In a second aspect, embodiments of the present invention provide a non-volatile readable storage medium storing computer-executable instructions for causing an electronic device to perform the above-described plug-in hash encryption method.
In a third aspect, an embodiment of the present invention provides an electronic device, including:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the plug-in hash encryption method described above.
In the plug-in hash encryption method provided by the embodiment of the invention, source data is acquired, the source data is preprocessed to obtain preprocessed source data, a preset encryption plug-in library is acquired, wherein the preset encryption plug-in library comprises at least two target hash encryption plug-ins, and at least one target hash encryption plug-in is called to execute hash operation on the preprocessed source data to obtain encrypted data. According to the embodiment, at least two target hash encryption plugins can be placed in the preset encryption plugin library in advance, a certain entropy-increasing disorder degree hash operation can be carried out on the preprocessed source data by calling corresponding target hash encryption plugins from the preset encryption plugin library, different requirements of different business scenes on the entropy-increasing disorder degree of the encrypted data can be met, the coupling degree between different target hash encryption plugins is low, the target hash encryption plugins can be plugged and pulled out, adaptability of a hash encryption algorithm is improved, and users can customize algorithm encryption according to business requirements.
Drawings
One or more embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements, and in which the figures of the drawings are not to be taken in a limiting sense, unless otherwise indicated.
Fig. 1 is a schematic flow chart of a plug-in hash encryption method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a state of performing a Z-shaped interferometry operation on a value of each ternary provided by an embodiment of the present invention;
FIG. 3 is a schematic diagram illustrating a state of performing a 3D enhancement operation on the numerical value of each ternary number according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a state of performing a flip operation on a value of each ternary number according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a state of performing an external numerical operation on a numerical value of each ternary number according to an embodiment of the present invention;
fig. 6 is a schematic circuit diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The present invention 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 invention 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 invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that, if not in conflict, the features of the embodiments of the present invention may be combined with each other, which is within the protection scope of the present invention. In addition, while functional block division is performed in a device diagram and logical order is shown in a flowchart, in some cases, the steps shown or described may be performed in a different order than the block division in the device, or in the flowchart. Furthermore, the words "first," "second," "third," and the like as used herein do not limit the order of data and execution, but merely distinguish between identical or similar items that have substantially the same function and effect.
The embodiment of the invention provides a plug-in hash encryption method. Referring to fig. 1, the plug-in hash encryption method includes the following steps:
s11: and acquiring source data, and preprocessing the source data to obtain preprocessed source data.
In this step, the source data is data for which hash encryption operation needs to be performed. The source data is expressed in binary form, wherein the number of bits of the source data is not fixed.
The preprocessed source data can be two-dimensional data or three-dimensional data.
In some embodiments, the preprocessed source data comprises at least one three-dimensional data matrix, and preprocessing the source data to obtain preprocessed source data comprises: at least one three-dimensional data matrix is generated from the source data. Wherein, the matrix size of the three-dimensional data matrix can be customized by a designer according to the service requirement, the matrix size of the three-dimensional data matrix is 8 x 64 matrix or 8 x 8 matrix or 16 x 16 matrix.
In some embodiments, generating at least one three-dimensional data matrix from the source data comprises: the source data is divided into a plurality of equal-length data segments, and a three-dimensional data matrix corresponding to each data segment is generated. The data segment is a data set formed by a plurality of numerical values intercepted from source data according to a specified bit number, and the bit numbers of any two data points are equal, wherein the specified bit number can be customized by a designer according to service requirements. In some embodiments, the specified number of bits is 2 to the power N, where N is a positive integer. In some embodiments, N is 8, and thus the number of specified bits is 256 bits.
S12: and obtaining a preset encryption plug-in library, wherein the preset encryption plug-in library comprises at least two target hash encryption plug-ins.
In this step, the preset encryption plug-in library is a container for storing a target hash encryption plug-in advance, and the target hash encryption plug-in is a hash encryption plug-in stored in the preset encryption plug-in library, where the hash encryption plug-in is used for completing entropy confusion of the preprocessed source data.
S13: and calling at least one target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain encrypted data.
In this step, the hashing operation is used to hash the value of the preprocessed source data. According to the embodiment, at least two target hash encryption plugins can be placed in the preset encryption plugin library in advance, a certain entropy-increasing disorder degree hash operation can be carried out on the preprocessed source data by calling corresponding target hash encryption plugins from the preset encryption plugin library, different requirements of different business scenes on the entropy-increasing disorder degree of the encrypted data can be met, the coupling degree between different target hash encryption plugins is low, the target hash encryption plugins can be plugged and pulled out, adaptability of a hash encryption algorithm is improved, and users can customize algorithm encryption according to business requirements.
In some embodiments, the number of target hash encryption plugins may be multiple, the at least one target hash encryption plugin includes a first target hash encryption plugin and a second target hash encryption plugin, and invoking the at least one target hash encryption plugin to perform a hashing operation on the preprocessed source data includes the steps of: and calling a first target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain intermediate data, wherein an output interface of the first target hash encryption plug-in is connected with a first input interface of a second target hash encryption plug-in, and calling the second target hash encryption plug-in to execute hash operation on the intermediate data to obtain encrypted data. It can be understood that when more than two target hash encryption plugins are invoked to perform a hashing operation on the preprocessed source data, the output value of the previous target hash encryption plugin in this embodiment is taken as the input value of the next target hash encryption plugin, and the next target hash encryption plugin performs a hashing operation on the output value of the previous target hash encryption plugin.
For example, the output interface of the first target hash encryption plug-in CH1 is connected to the first input interface of the second target hash encryption plug-in CH2, the preprocessed source data is input into the first target hash encryption plug-in CH1, and the first target hash encryption plug-in CH1 performs a hashing operation on the preprocessed source data to obtain intermediate data. Then, the first target hash encryption plug-in CH1 inputs the intermediate data to the first input interface of the second target hash encryption plug-in CH2 through the output interface, and the second target hash encryption plug-in CH2 performs a hashing operation on the intermediate data to obtain encrypted data.
In the embodiment, the low coupling degree between the target hash encryption plugins is utilized, so that the pluggable performance is high, and a plurality of target hash encryption plugins can customize the hash operation of the preprocessed source data of the same data segment for a plurality of times.
In some embodiments, the second input interface of the second target hash encryption plug-in is used for inputting preset data, and invoking the second target hash encryption plug-in to perform a hashing operation on the intermediate data, so as to obtain encrypted data includes the following steps: and calling a second target hash encryption plug-in to fuse the intermediate data with the preset data to obtain intermediate fused data, and calling the second target hash encryption plug-in to execute hash operation on the intermediate fused data to obtain encrypted data.
The preset data may be custom by the designer and in some embodiments is a three-dimensional data matrix corresponding to at least one data segment following the current data segment. Examples of the examplesIn other words, the present embodiment calls the first target hash encryption plug-in to data segment D 1 Performs a hashing operation on a three-dimensional data matrix of (1), wherein the preset data is a data segment D 2 Then invoking a second target hash encryption plug-in to intermediate data and data segment D 2 And finally, calling a second target hash encryption plug-in to execute hash operation on the intermediate fusion data to obtain encrypted data. The embodiment is beneficial to increasing the entropy and increasing the disorder degree and improving the encryption efficiency by introducing preset data.
In some embodiments, the present embodiment obtains global variable information, and generates preset data according to the global variable information. In some embodiments, the global variable information includes one or a combination of more than two of data segment number information before the padding, source data length information, data length information after the padding, and data segment number information after the padding. Because the global variable information is unknown to an attacker, the difficulty of reverse decoding of the encrypted data is increased, and the attack of length extension is avoided.
In some embodiments, the target hash encryption plug-in includes at least two algorithm units for performing hashing operations on the preprocessed source data from different dimensions. For a target hash encryption plugin, since different algorithm units perform hash operation on the preprocessed source data from different dimensions, the target hash encryption plugin can maximally increase entropy-increasing confusion of the preprocessed source data.
In some embodiments, the preprocessed source data comprises a three-dimensional data matrix. The at least two algorithm units comprise a numerical value arrangement algorithm unit and a numerical value updating algorithm unit, wherein the numerical value arrangement algorithm unit is used for executing position transformation operation in any one or more directions of an X axis, a Y axis and a Z axis of the three-dimensional data matrix on the numerical value of the three-dimensional data matrix, and the numerical value updating algorithm unit is used for executing numerical value updating operation on the numerical value of the three-dimensional data matrix.
In some embodiments, the numerical permutation algorithm unit includes a Z-axis drift algorithm unit, an XY-axis torsion algorithm unit, and a flip algorithm unit. The Z-axis drift algorithm unit is used for controlling the numerical value of the three-dimensional data matrix to move in the Z-axis direction of the three-dimensional data matrix. The XY axis torsion algorithm unit is used for controlling the numerical value of the three-dimensional data matrix to move between the X axis and the Y axis of the three-dimensional data matrix, and the turnover algorithm unit is used for controlling the numerical value of the three-dimensional data matrix to rotate around the designated axis.
In some embodiments, the numerical update algorithm unit includes an iterative update unit and an external numerical operation unit. The iterative updating unit is used for updating the target matrix value based on at least one front value arranged before the target matrix value, and the external value operation unit is used for updating the three-dimensional data matrix according to the external value.
In some embodiments, the iterative update unit includes a Z-shaped interferometry algorithm unit and a 3D enhancement algorithm unit. The Z-shaped interference algorithm unit is used for selecting at least one front numerical value arranged in front of the target matrix numerical value based on a Z-shaped value selecting mode and updating the target matrix numerical value by using the at least one front numerical value. The 3D enhancement algorithm unit is used for selecting front numerical values positioned before the target matrix numerical value on the X axis, the Y axis and the Z axis of the three-dimensional data matrix by taking the target matrix numerical value as a center, and updating the target matrix numerical value by using at least one front numerical value.
In some embodiments, any value permutation algorithm unit and any value update algorithm unit may be packaged into the target hash encryption plugin, where the target hash encryption plugin does not depend on the existence or existence sequence of other target hash encryption plugins, or is not dependent on the existence or existence sequence of other target hash encryption plugins, that is, the coupling degree between the target hash encryption plugins is low, each target hash encryption plugin may independently complete a hash operation with a certain entropy increasing chaos degree, and the sequence in which any two target hash encryption plugins execute the hash operation may be arbitrary. In addition, the target hash encryption plug-in can also provide one or both of an input interface of a starting stage and an output interface of an ending stage so as to realize the function of the local sponge structure. A developer or a user can customize the hash encryption system meeting own business requirements by selecting a corresponding hash encryption plug-in as a target hash encryption plug-in.
In some embodiments, the present embodiment may select a numerical permutation algorithm unit among the Z-axis drift algorithm unit, the XY-axis torsion algorithm unit, and the flip algorithm unit, and select a numerical update algorithm unit among the Z-shaped interference algorithm unit, the 3D enhancement algorithm unit, and the external numerical operation unit, and package the two into the target hash encryption plug-in.
In some embodiments, the present embodiment encapsulates the Z-axis drift algorithm unit and the Z-shaped interferometry algorithm unit into a first candidate hash encryption plug-in, encapsulates the XY-axis twist algorithm unit and the 3D enhancement algorithm unit into a second candidate hash encryption plug-in, and encapsulates the flip algorithm unit and the external numerical operation unit into a third candidate hash encryption plug-in. The embodiment may optionally use one or two or three candidate hash encryption plugins among the first candidate hash encryption plugin, the second candidate hash encryption plugin and the third candidate hash encryption plugin as the target hash encryption plugin.
In some embodiments, invoking at least one hashed cryptographic plug-in to perform a hashing operation on the pre-processed source data includes: and respectively calling a numerical value arrangement algorithm unit and a numerical value updating algorithm unit to execute hash operation on the three-dimensional data matrix.
In some embodiments, the target hash encryption plug-in is any one of a first candidate hash encryption plug-in, a second candidate hash encryption plug-in, and a third candidate hash encryption plug-in, and invoking at least one target hash encryption plug-in to perform a hashing operation on the preprocessed source data comprises: and calling a numerical value arrangement algorithm unit of the first candidate hash encryption plugin or the second candidate hash encryption plugin or the third candidate hash encryption plugin, and executing hash operation on the three-dimensional data matrix by using a numerical value updating algorithm unit.
In some embodiments, the at least one target hash encryption plug-in includes a first candidate hash encryption plug-in and a second candidate hash encryption plug-in, and invoking the at least one target hash encryption plug-in to perform a hashing operation on the preprocessed source data includes: and after the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the first candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix, the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the second candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix.
In some embodiments, the at least one target hash encryption plug-in includes a first candidate hash encryption plug-in and a third candidate hash encryption plug-in, and invoking the at least one target hash encryption plug-in to perform a hashing operation on the preprocessed source data includes: and after the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the first candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix, the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the third candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix.
In some embodiments, the at least one target hash encryption plug-in includes a first candidate hash encryption plug-in, a second candidate hash encryption plug-in, and a third candidate hash encryption plug-in, and invoking the at least one target hash encryption plug-in to perform a hashing operation on the preprocessed source data includes: and after the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the first candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix, the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the second candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix, and finally the numerical value arrangement algorithm unit and the numerical value updating algorithm unit of the third candidate hash encryption plug-in are called to execute the hash operation on the three-dimensional data matrix.
In some embodiments, invoking the numerical permutation algorithm unit and the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: firstly, a numerical value arrangement algorithm unit is called to execute hash operation on the three-dimensional data matrix to obtain a first inter-round data matrix, and then a numerical value update algorithm unit is called to execute hash operation on the first inter-round data matrix.
In some embodiments, invoking the numerical permutation algorithm unit and the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: firstly, a numerical value updating algorithm unit is called to execute hash operation on the three-dimensional data matrix to obtain a first round of data matrix, and then a numerical value arrangement algorithm unit is called to execute hash operation on the first round of data matrix.
In some embodiments, when the numerical permutation algorithm unit is a Z-axis drift algorithm unit, invoking the numerical permutation algorithm unit to perform a hashing operation on the three-dimensional data matrix comprises: and executing Z-axis drifting operation on the numerical value of each ternary number according to a preset Z-axis drifting function.
In some embodiments, when the numerical update algorithm unit is an iterative update unit, invoking the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: and determining a target matrix value, wherein the target matrix value is any value in the three-dimensional data matrix, and updating the target matrix value according to at least one front value arranged in front of the target matrix value to obtain an updated target matrix value.
In some embodiments, the iterative updating unit comprises a Z-shaped interferometry algorithm unit, updating the target matrix value based on at least one preceding value arranged before the target matrix value comprises: according to a preset Z-shaped interference function, at least one numerical value arranged in front of the numerical value of the target matrix is selected in the three-dimensional data matrix to serve as a front numerical value, and the numerical value of the target matrix is updated according to the at least one front numerical value.
Updating the target matrix values based on the at least one front value comprises: and carrying out exclusive-or processing on all the front numerical values, the target matrix numerical values and the ternary numbers of the target matrix numerical values to obtain an exclusive-or result, and updating the target matrix numerical values by using the exclusive-or result to obtain updated target matrix numerical values.
Wherein the pseudo code of the Z-shaped interference function is as follows:
1.For all triples (x, y, z) such that 0 ≤x<8, 0 ≤y<8, and 0 ≤z<w, let：
A[x, y, z] = A[x, y, z]⊕A[x, y, z-1]⊕A[x, y-1, z-1]⊕A[x-1, y-1, z-1]⊕A[x, y+1, z-1]⊕A[x+1, y+1, z-1]⊕z
2.Return A。
for a detailed understanding of the principles of the Z-shaped interferometry unit, this embodiment combines 8 x 8 as shown in fig. 2 is illustrated by the three-dimensional data matrix of:
referring to FIG. 2, the ternary numbers of the target matrix values are A2, 1, and then the ternary numbers of the preceding values are A2, 1, 0, A2, 0, A1, 0, A2, 2,0 and A3, 2,0, wherein the corresponding unit cells of A2, 1, 0, A2, 0, A1, 0, A2, 0 and A3, 2,0 may form a Z shape. In this embodiment, A2, 1, 0, A2, 0, A1, 0, A2, 0, A3, 2,0, A2, 1 and z=1 are exclusive-ored to obtain exclusive-ored result, and the exclusive-ored result is used to update the target matrix value whose ternary number is A2, 1.
The present embodiment updates the target matrix value using the front value, wherein the sequential relationship between the target matrix value and the front value is: the front values are preceded and the target matrix values are followed, and the target matrix values are exclusive-ored by a plurality of front values. It will be appreciated that as the value update depth increases, the target matrix values at the backward position are constrained by more levels of the front values in the three-dimensional data matrix, i.e., the target matrix values at the backward position are continuously iterated from the front values at a plurality of levels, which increases the difficulty of reverse derivation, increases irreversibility, and increases the entropy and disorder of the data.
In some embodiments, when the numerical permutation algorithm unit is an XY axis torsion algorithm unit, invoking the numerical permutation algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: and executing the XY axis torsion operation on the numerical value of each ternary number according to a preset XY axis torsion function.
In some embodiments, the iterative updating unit comprises a 3D enhancement algorithm unit, updating the target matrix value according to at least one preceding value arranged before the target matrix value comprises: according to a preset 3D enhancement function, a first direction value, a second direction value and a third direction value which are positioned before the target matrix value on the X axis, the Y axis and the Z axis of the three-dimensional data matrix are respectively determined, and the target matrix value is updated according to the first direction value, the second direction value and the third direction value.
Updating the target matrix values based on the at least one front value comprises: and performing exclusive-or processing on the first direction value, the second direction value, the third direction value, the target matrix value and the ternary number of the target matrix value to obtain an exclusive-or result, and updating the target matrix value by using the exclusive-or result to obtain the updated target matrix value.
Wherein the pseudo code of the 3D enhancement function is as follows:
1.For all triples (x, y, z) such that0≤x<8, 0≤y<8,and0≤z<w,let：
A[x, y, z]=A[x, y, z]⊕~A[x-1, y, z]⊕A[x, y-1, z]⊕~A[x, y, z-1]⊕x⊕y⊕z。
2.Return A.
To understand the principle of the 3D enhancement algorithm unit in detail, this embodiment is described with reference to fig. 3:
referring to FIG. 3, the ternary number of the target matrix value is A7,1,1, and the first direction value is arranged in front of the target matrix value in the X-axis direction, wherein the ternary number of the first direction value is A6,1,1. The second direction value is arranged in front of the target matrix value in the Y-axis direction, wherein the ternary number of the second direction value is A7, 0, 1. The third direction value is arranged in front of the target matrix value in the Z-axis direction, wherein the ternary number of the third direction value is A7, 1, 0. The first direction value, the second direction value and the third direction value are respectively left, upper and front of the target matrix value and are distributed in a three-dimensional form. In this embodiment, the first direction value and the third direction value are inverted, and then exclusive-or processing is performed on the first direction value and the third direction value and the first direction value, the value of A7, 1, the value of A7, 0,1, and the value of 1, 7,1, and 1, respectively, to obtain updated target matrix values.
In this embodiment, the forward value is used to update the target matrix value, where the sequential relationship between the target matrix value and the first, second and third direction values is: the first direction value, the second direction value and the third direction value are in front, the target matrix value is in back, and the target matrix value is obtained by exclusive-or of the first direction value, the second direction value and the third direction value. It will be appreciated that as the value update depth increases, the target matrix values at the backward position are constrained by more levels of the first direction values, the second direction values and the third direction values in the three-dimensional data matrix, i.e., the target matrix values at the backward position are continuously iterated from the first direction values, the second direction values and the third direction values at a plurality of levels in front, which increases the difficulty of reverse derivation and increases the degree of disorder of entropy of the data.
In some embodiments, when the numerical permutation algorithm unit is a flip algorithm unit, invoking the numerical permutation algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: and controlling the rotation of the three-dimensional data matrix to adjust the position of each numerical value in the three-dimensional data matrix.
In some embodiments, the flipping algorithm unit is a cubic flipping algorithm unit, wherein the cubic flipping algorithm unit rotates the three-dimensional data matrix using a right-hand rule. Wherein controlling rotation of the three-dimensional data matrix to adjust the position of each value in the three-dimensional data matrix comprises: and if the current circulation times are even, rotating the three-dimensional data matrix by a first preset angle according to a first preset rotation direction by taking the first designated shaft as a rotation center, and if the current circulation times are odd, rotating the three-dimensional data matrix by a second preset angle according to a second preset rotation direction by taking the second designated shaft as a rotation center, wherein the first designated shaft is one coordinate axis in the three-dimensional data matrix, and the second designated shaft is the other coordinate axis in the three-dimensional data matrix.
In some embodiments, the first designated axis is the X-axis of the three-dimensional data matrix and the second designated axis is the Z-axis of the three-dimensional data matrix. In some embodiments, the first preset angle and the second preset angle are both 90 degrees. In some embodiments, the first preset rotational direction is a counterclockwise direction and the second preset rotational direction is a clockwise direction.
In some embodiments, the pseudo code for rotating the three-dimensional data matrix by a first predetermined angle in a first predetermined rotation direction with the first designated axis as a rotation center is as follows:
a) If r is even, turn over 90 deg. around the right hand of the x-axis
A[x, y, z]=A[x, z, 7-y]
A[0, 0, 0]=A[0, 0, 7]
A[0, 7, 0]=A[0, 0, 0]
A[7, 7, 0]=A[7, 0, 0]
A[7, 0, 0]=A[7, 0, 7]
The matrix size of the three-dimensional data matrix is 8 x 8, and r is the number of cycles.
In some embodiments, the pseudo code for rotating the three-dimensional data matrix by a second predetermined angle in a second predetermined direction of rotation about a second predetermined axis of rotation is as follows:
b) If r is odd, turn over 90 deg. around the right hand of the z-axis
A[x, y, z]=A[y, 7-x, z]
A[0, 0, 0]=A[0, 7, 0]
A[0, 7, 0]=A[7, 7, 0]
A[7, 0, 0]=A[0, 0, 0]
A[7, 7, 0]=A[7, 0, 0]
To understand the principle of the flipping algorithm unit in detail, this embodiment is described with reference to fig. 4:
referring to fig. 4, on the premise that each data segment needs to undergo 16 rounds of hashing operations to obtain hashed segment data, when the number of cycles is 1, the embodiment rotates the three-dimensional data matrix by 90 degrees in the counterclockwise direction with the X-axis as the rotation center, so as to obtain the 1 st rotation matrix. Then, when the number of cycles is 2, the embodiment rotates the 1 st rotation matrix by 90 degrees in the clockwise direction with the Z axis as the rotation center to obtain the 2 nd rotation matrix, and so on, which will not be described here again.
In some embodiments, when the numerical update algorithm unit is an external numerical operation unit, invoking the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix includes: the method comprises the steps of obtaining external numerical values, generating an external three-dimensional matrix according to the external numerical values, enabling the matrix size of the external three-dimensional matrix to be consistent with the matrix size of the three-dimensional data matrix, and updating the three-dimensional data matrix according to the external three-dimensional matrix.
The existing SHA algorithm can be used for carrying out permutation calculation on values in the three-dimensional data matrix, so that the information of source data can be regarded as not being lost in the process of transformation operation, and the source data can be restored based on the output value in theory.
In this embodiment, the external value may be regarded as a magic messenger, that is, the external value is derived from a value not belonging to the three-dimensional data matrix, and by introducing the external value, the external three-dimensional matrix is generated based on the external value, and the external three-dimensional matrix is capable of deforming the value of the three-dimensional data matrix, which is equivalent to causing information loss of the three-dimensional data matrix, so that an attacker is not easy to push out source data in a reverse manner, thus increasing irreversibility and improving cracking difficulty. In addition, the embodiment can avoid being attacked by length extension by adopting the method, and the information security is improved.
In some embodiments, the external values comprise global variable information of the source data and/or an external key, and generating the external three-dimensional matrix from the external values comprises: the first three-dimensional matrix is generated according to the global variable information and/or the second three-dimensional matrix is generated according to the external key. Then: updating the three-dimensional data matrix from the external three-dimensional matrix comprises: and fusing the three-dimensional data matrix with the first three-dimensional matrix to obtain an updated three-dimensional data matrix, or fusing the three-dimensional data matrix with the second three-dimensional matrix to obtain an updated three-dimensional data matrix, or fusing the three-dimensional data matrix, the first three-dimensional matrix and the second three-dimensional matrix to obtain an updated three-dimensional data matrix. The first three-dimensional matrix, the second three-dimensional matrix and the three-dimensional data matrix are identical in matrix size.
The global variable information is information for globally describing source data. In some embodiments, the global variable information includes one or a combination of more than two of data segment number information before the padding, source data length information, data length information after the padding, and data segment number information after the padding. The number of data segments before the non-padding is the number of data segments in which the source data is divided into a plurality of data segments and the padding operation is not performed. The source data length information is the length of the source data. The length information of the padding field is that after the source data is divided into a plurality of data segments, the length of the padding field is increased in the last data segment. The number of data segments after the padding is the number of data segments after the source data is divided into a plurality of data segments and the padding operation is performed.
The external key is a key independent of the source data, e.g. the external key is a custom private key. The fusion process includes a numerical value change process such as an exclusive or process.
In order to understand the principle of the external numerical operation unit in detail, this embodiment is described with reference to fig. 5:
referring to fig. 5, in the embodiment, a first three-dimensional matrix 51 is generated according to global variable information, a second three-dimensional matrix 52 is generated according to an external key, and the three-dimensional data matrix 50, the first three-dimensional matrix 51 and the second three-dimensional matrix 52 are fused to obtain an updated three-dimensional data matrix 53.
In order to understand the role of the pluggable hash encryption plug-in detail, this embodiment provides 3 examples for explanation, as follows:
example 1:
the target hash encryption plug-in is a first candidate hash encryption plug-in, and the first candidate hash encryption plug-in comprises a Z-axis drift algorithm unit and a Z-shaped interference algorithm unit. The embodiment calls the first candidate hash encryption plugin to execute 16 rounds of hash operation on the three-dimensional data matrix, wherein in each round of hash operation, the embodiment firstly uses the Z-axis drifting algorithm unit to execute hash operation on the three-dimensional data matrix, and then uses the Z-shaped interference algorithm unit to execute hash operation, wherein the three-dimensional data matrix processed by the Z-shaped interference algorithm unit is used as input of the next round of hash operation.
Example 2:
the at least one target hash encryption plug-in comprises a second candidate hash encryption plug-in and a third candidate hash encryption plug-in, the second candidate hash encryption plug-in comprises an XY axis torsion algorithm unit and a 3D enhancement algorithm unit, and the third candidate hash encryption plug-in comprises a turnover algorithm unit and an external numerical operation unit. The embodiment executes 16 rounds of hash operation on the three-dimensional data matrix, wherein in each round of hash operation, the embodiment sequentially calls the second candidate hash encryption plugin and the third candidate hash encryption plugin to execute hash operation on the three-dimensional data matrix.
Specifically, in each round of hashing operation, the present embodiment performs a hashing operation on the three-dimensional data matrix using the XY-axis torsion algorithm unit, then performs a hashing operation using the 3D enhancement algorithm unit, then performs a hashing operation using the flip algorithm unit, and finally performs a hashing operation using the external numerical operation unit.
Example 3:
the at least one target hash encryption plug-in includes a first candidate hash encryption plug-in, a second candidate hash encryption plug-in, and a third candidate hash encryption plug-in. In this embodiment, 16 rounds of hashing operations are performed on the three-dimensional data matrix, where in each round of hashing operation, the first candidate hash encryption plug-in, the second candidate hash encryption plug-in, and the third candidate hash encryption plug-in are sequentially invoked to perform the hashing operation on the three-dimensional data matrix.
Specifically, in each round of hashing operation, the embodiment uses the Z-axis drift algorithm unit to perform the hashing operation on the three-dimensional data matrix, then uses the Z-shaped interference algorithm unit to perform the hashing operation, then uses the XY-axis torsion algorithm unit to perform the hashing operation on the three-dimensional data matrix, then uses the 3D enhancement algorithm unit to perform the hashing operation, then uses the flipping algorithm unit to perform the hashing operation, and finally uses the external numerical operation unit to perform the hashing operation.
As can be seen from the above examples, the degree of coupling between the hash encryption plugins is low, each hash encryption plugin can independently complete a hash operation with a certain entropy increasing disorder, the order in which any two hash encryption plugins execute the hash operation can be arbitrary, and the hash encryption plugin can also provide one or both of an input interface of a start stage and an output interface of an end stage so as to realize the function of a local sponge structure. A developer or user can customize the hash encryption system to meet their own business needs by selecting a corresponding hash encryption plug-in as the hash encryption plug-in.
It should be noted that, in the foregoing embodiments, there is not necessarily a certain sequence between the steps, and those skilled in the art will understand that, according to the description of the embodiments of the present invention, the steps may be performed in different orders in different embodiments, that is, may be performed in parallel, may be performed interchangeably, or the like.
Referring to fig. 6, fig. 6 is a schematic circuit structure of an electronic device according to an embodiment of the invention. As shown in fig. 6, the electronic device 60 includes one or more processors 61 and a memory 62. In fig. 6, a processor 61 is taken as an example.
The processor 61 and the memory 62 may be connected by a bus or otherwise, which is illustrated in fig. 6 as a bus connection.
The memory 62 is used as a non-volatile computer readable storage medium for storing non-volatile software programs, non-volatile computer executable programs, and modules, such as program instructions/modules corresponding to the plug-in hash encryption method in the embodiment of the present invention. The processor 61 implements the functions of the plug-in hash encryption method provided by the above-described method embodiment by running a nonvolatile software program, instructions, and modules stored in the memory 62.
The memory 62 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 62 may optionally include memory located remotely from processor 61, which may be connected to processor 61 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The program instructions/modules are stored in the memory 62 and when executed by the one or more processors 61 perform the plug-in hash encryption method of any of the method embodiments described above.
Embodiments of the present invention also provide a non-volatile computer storage medium storing computer-executable instructions that are executable by one or more processors, such as one processor 61 in fig. 6, to cause the one or more processors to perform the plug-in hash encryption method of any of the method embodiments described above.
Embodiments of the present invention also provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by an electronic device, cause the electronic device to perform any of the plug-in hash encryption methods.
The above-described embodiments of the apparatus or device are merely illustrative, in which the unit modules illustrated as separate components may or may not be physically separate, and the components shown as unit modules may or may not be physical units, may be located in one place, or may be distributed over multiple network module units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
From the above description of embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus a general purpose hardware platform, or may be implemented by hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the related art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the invention, the steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (10)
1. A method of plug-in hash encryption, comprising:
acquiring source data, and preprocessing the source data to obtain preprocessed source data;
obtaining a preset encryption plug-in library, wherein the preset encryption plug-in library comprises at least two target hash encryption plug-ins, the target hash encryption plug-ins are hash encryption plug-ins stored in the preset encryption plug-in library, the hash encryption plug-ins are used for completing entropy enhancing disorder on the preprocessed source data, the target hash encryption plug-ins comprise at least two algorithm units, and the at least two algorithm units are used for executing hash operation on the preprocessed source data from different dimensionalities;
and calling at least one target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain encrypted data.
2. The method of claim 1, wherein at least one of the target hash encryption plug-ins comprises a first target hash encryption plug-in and a second target hash encryption plug-in, the invoking at least one of the target hash encryption plug-ins to perform a hashing operation on the preprocessed source data to obtain encrypted data comprising:
Calling the first target hash encryption plug-in to execute hash operation on the preprocessed source data to obtain intermediate data, wherein an output interface of the first target hash encryption plug-in is connected with a first input interface of the second target hash encryption plug-in;
and calling the second target hash encryption plug-in to execute hash operation on the intermediate data to obtain encrypted data.
3. The method of claim 2, wherein the second input interface of the second target hash encryption plug-in is configured to input preset data, and wherein invoking the second target hash encryption plug-in to perform a hashing operation on the intermediate data, to obtain encrypted data comprises:
calling the second target hash encryption plug-in to fuse the intermediate data with the preset data to obtain intermediate fusion data;
and calling the second target hash encryption plug-in to execute hash operation on the intermediate fusion data to obtain encrypted data.
4. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the preprocessed source data comprises a three-dimensional data matrix;
the at least two algorithm units comprise a numerical value arrangement algorithm unit and a numerical value updating algorithm unit, wherein the numerical value arrangement algorithm unit is used for executing position transformation operation in any one or more directions of an X axis, a Y axis and a Z axis of the three-dimensional data matrix on the numerical value of the three-dimensional data matrix, and the numerical value updating algorithm unit is used for executing numerical value updating operation on the numerical value of the three-dimensional data matrix;
Invoking at least one of the target hash encryption plug-ins to perform a hashing operation on the preprocessed source data includes: and respectively calling the numerical value arrangement algorithm unit and the numerical value updating algorithm unit to execute hash operation on the three-dimensional data matrix.
5. The method of claim 4, wherein when the numerical permutation unit is a flip algorithm unit, invoking the numerical permutation algorithm unit to perform a hashing operation on the three-dimensional data matrix comprises: and controlling the rotation of the three-dimensional data matrix to adjust the position of each numerical value in the three-dimensional data matrix.
6. The method of claim 4, wherein when the numerical update algorithm unit is an iterative update unit, invoking the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix comprises:
determining a target matrix value, wherein the target matrix value is any value in the three-dimensional data matrix;
and updating the target matrix value according to at least one front value arranged in front of the target matrix value, and obtaining the updated target matrix value.
7. The method of claim 4, wherein when the numerical update algorithm unit is an external numerical operation unit, invoking the numerical update algorithm unit to perform a hashing operation on the three-dimensional data matrix comprises:
Obtaining an external numerical value;
generating an external three-dimensional matrix according to the external numerical value, wherein the matrix size of the external three-dimensional matrix is consistent with the matrix size of the three-dimensional data matrix;
and updating the three-dimensional data matrix according to the external three-dimensional matrix.
8. The method of claim 7, wherein the step of determining the position of the probe is performed,
the external numerical value comprises global variable information and/or an external key of the source data;
the generating an external three-dimensional matrix from the external values comprises: generating a first three-dimensional matrix according to the global variable information and/or generating a second three-dimensional matrix according to the external key;
then: said updating said three-dimensional data matrix from said external three-dimensional matrix comprises:
and fusing the three-dimensional data matrix, the first three-dimensional matrix and/or the second three-dimensional matrix to obtain an updated three-dimensional data matrix.
9. A non-transitory readable storage medium storing computer executable instructions for causing an electronic device to perform the plug-in hash encryption method of any one of claims 1 to 8.
10. An electronic device, comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the plug-in hash encryption method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310464845.5A CN116204910B (en) | 2023-04-27 | 2023-04-27 | Plug-in hash encryption method, nonvolatile readable storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310464845.5A CN116204910B (en) | 2023-04-27 | 2023-04-27 | Plug-in hash encryption method, nonvolatile readable storage medium and electronic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116204910A CN116204910A (en) | 2023-06-02 |
| CN116204910B true CN116204910B (en) | 2023-08-18 |
Family
ID=86507943
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310464845.5A Active CN116204910B (en) | 2023-04-27 | 2023-04-27 | Plug-in hash encryption method, nonvolatile readable storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116204910B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7987497B1 (en) * | 2004-03-05 | 2011-07-26 | Microsoft Corporation | Systems and methods for data encryption using plugins within virtual systems and subsystems |
| US9973481B1 (en) * | 2015-06-16 | 2018-05-15 | Amazon Technologies, Inc. | Envelope-based encryption method |
| US10033703B1 (en) * | 2015-06-16 | 2018-07-24 | Amazon Technologies, Inc. | Pluggable cipher suite negotiation |
| CN115270161A (en) * | 2022-08-15 | 2022-11-01 | 北京八分量信息科技有限公司 | Encryption method and device based on encryption plug-in and related product |
| CN115391801A (en) * | 2022-08-15 | 2022-11-25 | 北京八分量信息科技有限公司 | Method and device for updating encryption module in block chain system and related products |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3188063A1 (en) * | 2015-12-29 | 2017-07-05 | GuardSquare NV | A build system |
-
2023
- 2023-04-27 CN CN202310464845.5A patent/CN116204910B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7987497B1 (en) * | 2004-03-05 | 2011-07-26 | Microsoft Corporation | Systems and methods for data encryption using plugins within virtual systems and subsystems |
| US9973481B1 (en) * | 2015-06-16 | 2018-05-15 | Amazon Technologies, Inc. | Envelope-based encryption method |
| US10033703B1 (en) * | 2015-06-16 | 2018-07-24 | Amazon Technologies, Inc. | Pluggable cipher suite negotiation |
| CN115270161A (en) * | 2022-08-15 | 2022-11-01 | 北京八分量信息科技有限公司 | Encryption method and device based on encryption plug-in and related product |
| CN115391801A (en) * | 2022-08-15 | 2022-11-25 | 北京八分量信息科技有限公司 | Method and device for updating encryption module in block chain system and related products |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116204910A (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11082482B2 (en) | Block chain encoding with fair delay for distributed network devices | |
| Schneider et al. | GMW vs. Yao? Efficient secure two-party computation with low depth circuits | |
| US10467389B2 (en) | Secret shared random access machine | |
| US20210243005A1 (en) | Fully homomorphic encryption method and device and computer readable storage medium | |
| CN114175572B (en) | System and method for performing equal and less operations on encrypted data using a quasi-group operation | |
| KR20150102827A (en) | USER DEVICE PERFORMING PASSWROD BASED AUTHENTICATION AND PASSWORD Registration AND AUTHENTICATION METHOD THEREOF | |
| CN111464308A (en) | Method and system for realizing reconstruction of multiple Hash algorithms | |
| JP4612680B2 (en) | Apparatus and method for performing MD5 digesting | |
| US10749670B2 (en) | Block chain decoding with fair delay for distributed network devices | |
| CN110493009A (en) | The generation method and verification method of signature, device, equipment and medium | |
| CN110336661B (en) | AES-GCM data processing method, device, electronic equipment and storage medium | |
| CN110417553B (en) | Multi-party secret communication method and device and user terminal | |
| CN116318660B (en) | Message expansion and compression method and related device | |
| CN114221766B (en) | Data encryption method, data decryption method and data encryption device | |
| CN113722734A (en) | Method, device and system for determining selection result fragmentation by two-party security selection | |
| CN113626871A (en) | Two-party multi-branch condition implementation method and system for protecting private data | |
| CN116821961A (en) | Boolean arithmetic sharing conversion method and device for protecting privacy data | |
| Shantha et al. | Analysis and implementation of ECC algorithm in lightweight device | |
| CN112100144A (en) | Block chain file sharing method and device, storage medium and electronic equipment | |
| Sim et al. | K-XMSS and K-SPHINCS $^+ $: Hash based Signatures with\\Korean Cryptography Algorithms | |
| US11290456B2 (en) | Secret equality determination system, secret equality determination method and secret equality determination program recording medium | |
| WO2024086243A1 (en) | Protection of polynomial cryptographic operations against side-channel attacks with change-of-variable transformations | |
| CN116204910B (en) | Plug-in hash encryption method, nonvolatile readable storage medium and electronic device | |
| CN116186746A (en) | Parallel hash encryption method, storage medium and electronic device | |
| CN114499845A (en) | Multi-party secure computing method, device and system |
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 |