CN116089989A - Data iterative encryption processing method for offline data terminal - Google Patents
Data iterative encryption processing method for offline data terminal Download PDFInfo
- Publication number
- CN116089989A CN116089989A CN202310371008.8A CN202310371008A CN116089989A CN 116089989 A CN116089989 A CN 116089989A CN 202310371008 A CN202310371008 A CN 202310371008A CN 116089989 A CN116089989 A CN 116089989A
- Authority
- CN
- China
- Prior art keywords
- key
- quantum
- random number
- data
- quantum random
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 13
- 238000000034 method Methods 0.000 claims abstract description 29
- 230000006872 improvement Effects 0.000 claims abstract description 7
- 230000000295 complement effect Effects 0.000 claims description 18
- 238000006243 chemical reaction Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 claims description 4
- 238000006386 neutralization reaction Methods 0.000 claims description 3
- 230000009469 supplementation Effects 0.000 claims description 3
- 230000001502 supplementing effect Effects 0.000 claims description 3
- 238000005336 cracking Methods 0.000 abstract description 2
- 230000006855 networking Effects 0.000 abstract description 2
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 238000003860 storage Methods 0.000 description 3
- 238000011426 transformation method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000005429 filling process Methods 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000004519 manufacturing process 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
- 230000009466 transformation Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
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
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/60—Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Software Systems (AREA)
- Computer Security & Cryptography (AREA)
- Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Artificial Intelligence (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to the field of data iterative encryption, in particular to a data iterative encryption processing method for an offline data end, which comprises the following steps: s1, carrying out key initialization filling treatment on an offline data terminal; s2, acquiring a real-time key iteration state in the offline data terminal; s3, data encryption processing is carried out according to the real-time key iteration state, key division and resetting under various conditions are achieved on the basis of single quantum random number filling of an offline data end, meanwhile, when the secret performance of the key is reduced, an improvement method is provided, on the basis of the offline data end, networking updating is not needed, randomness of the key is improved, the possibility of data leakage and key cracking is reduced, and the method has high adaptability in various offline data ends.
Description
Technical Field
The invention relates to the field of data iterative encryption, in particular to a data iterative encryption processing method for an offline data end.
Background
In certain specific environments, the device side needs to be physically offline to meet the isolation standard, in the physical offline, the data in the device side cannot be encrypted through operations such as online exchange, and meanwhile, the encryption performance is linearly reduced due to repeated encryption of a single or multiple keys under the condition of fixed knowledge until confidentiality is thoroughly lost after encryption for a certain time, so that the loss is caused by leakage of confidential data, and the key updating process in the device side cannot be too complicated, so that the normal use of the system is affected after most of memory of the system is occupied.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a data iterative encryption processing method for an offline data end, which realizes that the secret performance is improved by the key iteration in the offline data end by carrying out the key division and the resetting based on quantum random numbers in the offline data end.
In order to achieve the above object, the present invention provides a data iterative encryption processing method for an offline data terminal, including:
s1, carrying out key initialization filling treatment on an offline data terminal;
s2, acquiring a real-time key iteration state in the offline data terminal;
and S3, carrying out data encryption processing according to the real-time key iteration state.
Preferably, the key initialization filling process for the offline data terminal includes:
generating a quantum random number by using a quantum random number generator as an initialized quantum random number;
and carrying out key initialization filling processing on the offline data terminal by using the initialization quantum random number.
Preferably, the obtaining the real-time key iteration state in the offline data end includes:
s2-1, dividing and processing by using an initialization quantum random number in an offline data end to obtain an initialization quantum key;
s2-2, establishing an iterative key pool by using the initialization quantum key;
s2-3, obtaining a real-time key iteration state according to the iteration key pool;
the initialization quantum random number and the initialization quantum key are not completely corresponding.
Further, the step of obtaining the initialization quantum key by dividing the initialization quantum random number in the offline data terminal includes:
dividing the initialized quantum random number according to the data to be encrypted to obtain a quantum key corresponding to the data to be encrypted;
obtaining a redundant quantum random number of the initialized quantum random number according to the quantum key corresponding to the data to be encrypted;
performing secondary division processing according to the data to be encrypted by using the redundant quantum random number to obtain a backup quantum key corresponding to the data to be encrypted;
using the quantum key corresponding to the data to be encrypted and the backup quantum key corresponding to the data to be encrypted as initialization quantum keys;
the quantum key corresponding to the data to be encrypted is used for data encryption processing, and the backup quantum key corresponding to the data to be encrypted is used for key supplementing backup.
Further, establishing an iterative key pool using the initialization quantum key includes:
obtaining the rest quantum random numbers of the initialization quantum random numbers as candidate quantum random numbers according to the initialization quantum key;
establishing a candidate quantum random number pool by using the candidate quantum random numbers;
establishing a used quantum key pool by utilizing the initialized quantum key;
and using the used quantum key pool and the candidate quantum random number pool as an iteration key pool.
Further, obtaining the real-time key iteration state according to the iteration key pool includes:
s2-3-1, judging whether a candidate quantum random number pool in the iterative key pool meets the minimum dividing requirement, if so, not processing, otherwise, carrying out reassignment processing by using the used quantum key pool and the candidate quantum random number pool in the iterative key pool to obtain reassigned results;
s2-3-2, when the candidate quantum random number pool in the iteration key pool meets the minimum requirement of division, the real-time key iteration state is no iteration;
s2-3-3, when a candidate quantum random number pool in an iteration key pool does not meet the minimum dividing requirement, judging whether all quantum keys of the initialization quantum key meet the minimum dividing requirement, if so, starting backup quantum key supplementation of the initialization quantum key to a quantum key corresponding to data to be encrypted to obtain a real-time key iteration state, and otherwise, obtaining the real-time key iteration state according to a reassignment processing result;
the minimum dividing requirement is that the quantum random numbers in the candidate quantum random number pool are divided into complete quantum keys according to the data to be encrypted.
Further, the step of performing reassignment processing on the used quantum key pool and the candidate quantum random number pool in the iterative key pool to obtain reassigned results includes:
s2-3-1-1, acquiring a used quantum key with the longest existing time in the used quantum key pool;
s2-3-1-2, obtaining a corresponding used quantum random number as a first quantum random number according to the used quantum key with the longest existing time;
s2-3-1-3, obtaining a first conversion quantum random number by utilizing the first quantum random number based on a random number conversion method;
s2-3-1-4, deleting a used quantum key corresponding to the first quantum random number from the used quantum key pool;
s2-3-1-5, acquiring a used quantum key with the longest existing time in a current used quantum key pool as a complementary quantum key;
s2-3-1-6, acquiring a used quantum random number corresponding to the complementary quantum key as a complementary quantum random number;
s2-3-1-7, deleting a used quantum key corresponding to the supplementary quantum key from the used quantum key pool;
s2-3-1-8, judging whether the total length of the first quantum random number and the complementary quantum random number is larger than the total length of the candidate quantum random numbers in the candidate quantum random number pool, if so, performing complementary combining processing according to the first quantum random number by using the complementary quantum random number to obtain an iterative candidate quantum random number, finishing reassigning processing to obtain a reassigning result, otherwise, returning to S2-3-1-5;
the random number conversion method comprises an LCG algorithm and a Meissen rotation algorithm, and the supplementary combination processing is to sequentially insert the supplementary quantum random numbers into the rear parts of corresponding numbers in the first quantum random numbers according to the head and tail numbers of the supplementary quantum random numbers.
Further, obtaining the real-time key iteration state according to the reassignment processing result includes:
when the corresponding cycle number of the reassignment result is not 1, the real-time key iteration state is multiple iterations;
and when the reassignment result corresponds to the cycle number of 1, the real-time key iteration state is a single iteration.
Preferably, the data encryption processing according to the real-time key iteration state includes:
when the key iteration state is no iteration, directly encrypting the data to be encrypted by using an iteration key pool;
when the key iteration state is single iteration, after direct encryption processing is carried out on data to be encrypted by utilizing an iteration key pool, judging whether the direct encryption processing completely meets encryption requirements, if so, completing data encryption processing, otherwise, returning to S2-3-1-5;
when the key iteration state is multiple iterations, performing direct encryption processing on data to be encrypted by using an iteration key pool, and then performing multiple iteration improvement processing to complete data encryption processing;
the direct encryption processing is to encrypt data to be encrypted after carrying out key division by using candidate quantum random numbers of an iterative key pool, and divide the quantum key which is encrypted into a used quantum key pool; the encryption requirement is to complete single complete encryption of the current data to be encrypted.
Further, the performing a plurality of iterative improvement processes includes:
when the data to be encrypted is subjected to direct encryption processing, acquiring a used quantum random number corresponding to each used quantum key of a used quantum key pool in an iteration key pool as a quantum random number to be improved;
obtaining an improved quantum random number based on a square neutralization method by utilizing the quantum random number to be improved;
combining the improved quantum random number with the candidate quantum random number in the candidate quantum random number pool in the iterative key pool to be used as an updated initialization quantum random number;
and returning S2-1 by using the updated initialization quantum random number.
Compared with the closest prior art, the invention has the following beneficial effects:
on the basis of single quantum random number filling of the offline data end, key dividing and resetting under various conditions are realized, meanwhile, when the secret property of the key is reduced, an improvement method is provided, on the basis of the offline data end, networking updating is not needed, the randomness of the key is improved, the possibility of data leakage and key cracking is reduced, and the method has higher adaptability in various offline data ends.
Drawings
Fig. 1 is a flowchart of a data iterative encryption processing method for an offline data terminal.
Detailed Description
The following describes the embodiments of the present invention in further detail with reference to the drawings.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present 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.
Example 1: the invention provides a data iterative encryption processing method for an offline data end, which is shown in figure 1 and comprises the following steps:
s1, carrying out key initialization filling treatment on an offline data terminal;
s2, acquiring a real-time key iteration state in the offline data terminal;
and S3, carrying out data encryption processing according to the real-time key iteration state.
S1 specifically comprises:
s1-1, generating a quantum random number by using a quantum random number generator as an initialization quantum random number;
s1-2, carrying out key initialization filling processing on the offline data terminal by utilizing the initialization quantum random number.
In this embodiment, a data iterative encryption processing method for an offline data end, where the quantum random number generator generates a quantum random number based on a BB84 protocol.
S2 specifically comprises:
s2-1, dividing and processing by using an initialization quantum random number in an offline data end to obtain an initialization quantum key;
s2-2, establishing an iterative key pool by using the initialization quantum key;
s2-3, obtaining a real-time key iteration state according to the iteration key pool;
the initialization quantum random number and the initialization quantum key are not completely corresponding.
In this embodiment, in the data iterative encryption processing method for the offline data end, the length of the initialized quantum random number is the total length of all quantum random numbers in the offline data end, and all quantum random numbers corresponding to the initialized quantum key are smaller than or equal to the initialized quantum random number.
S2-1 specifically comprises:
s2-1-1, dividing the data to be encrypted by using the initialization quantum random number to obtain a quantum key corresponding to the data to be encrypted;
s2-1-2, obtaining a redundant quantum random number of the initialization quantum random number according to the quantum key corresponding to the data to be encrypted;
s2-1-3, performing secondary division processing according to the data to be encrypted by utilizing the redundant quantum random number to obtain a backup quantum key corresponding to the data to be encrypted;
s2-1-4, using the quantum key corresponding to the data to be encrypted and the backup quantum key corresponding to the data to be encrypted as an initialization quantum key;
the quantum key corresponding to the data to be encrypted is used for data encryption processing, and the backup quantum key corresponding to the data to be encrypted is used for key supplementing backup.
S2-2 specifically comprises:
s2-2-1, obtaining the rest quantum random numbers of the initialization quantum random numbers as candidate quantum random numbers according to the initialization quantum key;
s2-2-2, establishing a candidate quantum random number pool by using the candidate quantum random numbers;
s2-2-3, establishing a used quantum key pool by utilizing the initialized quantum key;
s2-2-4, using the used quantum key pool and the candidate quantum random number pool as an iteration key pool.
S2-3 specifically comprises:
s2-3-1, judging whether a candidate quantum random number pool in the iterative key pool meets the minimum dividing requirement, if so, not processing, otherwise, carrying out reassignment processing by using the used quantum key pool and the candidate quantum random number pool in the iterative key pool to obtain reassigned results;
s2-3-2, when the candidate quantum random number pool in the iteration key pool meets the minimum requirement of division, the real-time key iteration state is no iteration;
s2-3-3, when a candidate quantum random number pool in an iteration key pool does not meet the minimum dividing requirement, judging whether all quantum keys of the initialization quantum key meet the minimum dividing requirement, if so, starting backup quantum key supplementation of the initialization quantum key to a quantum key corresponding to data to be encrypted to obtain a real-time key iteration state, and otherwise, obtaining the real-time key iteration state according to a reassignment processing result;
the minimum dividing requirement is that the quantum random numbers in the candidate quantum random number pool are divided into complete quantum keys according to the data to be encrypted.
S2-3-1 specifically comprises:
s2-3-1-1, acquiring a used quantum key with the longest existing time in the used quantum key pool;
s2-3-1-2, obtaining a corresponding used quantum random number as a first quantum random number according to the used quantum key with the longest existing time;
s2-3-1-3, obtaining a first conversion quantum random number by utilizing the first quantum random number based on a random number conversion method;
s2-3-1-4, deleting a used quantum key corresponding to the first quantum random number from the used quantum key pool;
s2-3-1-5, acquiring a used quantum key with the longest existing time in a current used quantum key pool as a complementary quantum key;
s2-3-1-6, acquiring a used quantum random number corresponding to the complementary quantum key as a complementary quantum random number;
s2-3-1-7, deleting a used quantum key corresponding to the supplementary quantum key from the used quantum key pool;
s2-3-1-8, judging whether the total length of the first quantum random number and the complementary quantum random number is larger than the total length of the candidate quantum random numbers in the candidate quantum random number pool, if so, performing complementary combining processing according to the first quantum random number by using the complementary quantum random number to obtain an iterative candidate quantum random number, finishing reassigning processing to obtain a reassigning result, otherwise, returning to S2-3-1-5;
the random number conversion method comprises an LCG algorithm and a Meissen rotation algorithm, and the supplementary combination processing is to sequentially insert the supplementary quantum random numbers into the rear parts of corresponding numbers in the first quantum random numbers according to the head and tail numbers of the supplementary quantum random numbers.
In this embodiment, the length of the first quantum random number is inversely proportional to the strength of the random number transformation method, that is, the longer the first quantum random number is, the simpler transformation is performed by selecting the LCG algorithm, and the operating pressure of the offline data end is reduced, otherwise, the shorter the first quantum random number is, the mersen rotation algorithm is selected, and the purpose of high randomness is achieved by using the complex algorithm under the condition that the length is shorter. When the adjacent two random number transformation methods are both LCG algorithms, the recurrence formula is as follows:
wherein X is n X is the current quantum random number n+1 A, C, m are constants for the transformed quantum random number.
The implementation of the mersen rotation algorithm is as follows:
def _int32(x):
return int(0xFFFFFFFF&x)
class MT19937:
def __init__(self, seed):
self.mt = [0] * 624
self.mt[0] = seed
self.mti = 0
for i in range(1, 624):
self.mt[i] = _int32(1812433253 * (self.mt[i - 1]^ self.mt[i - 1]>>30) + i)
def extract_number(self):
if self.mti == 0:
self.twist()
y = self.mt[self.mti]
y = y ^ y>>11
y = y ^ y<<7&2636928640
y = y ^ y<<15&4022730752
y = y ^ y>>18
self.mti = (self.mti + 1) % 624
return _int32(y)
def twist(self):
for i in range(0, 624):
y = _int32((self.mt[i]&0x80000000) + (self.mt[(i + 1) % 624]&0x7fffffff))
self.mt[i] = (y>>1) ^ self.mt[(i + 397) % 624]
if y % 2 != 0:
self.mt[i] = self.mt[i]^ 0x9908b0df
s2-3-3 specifically includes:
s2-3-3-1, when the corresponding cycle number of the reassignment result is not 1, the real-time key iteration state is multiple iterations;
s2-3-3-2, when the reassignment result corresponds to the cycle number of 1, the real-time key iteration state is single iteration.
S3 specifically comprises:
s3-1, when the key iteration state is no iteration, directly encrypting the data to be encrypted by using an iteration key pool;
s3-2, when the key iteration state is single iteration, directly encrypting the data to be encrypted by using an iteration key pool, judging whether the direct encryption completely meets encryption requirements, if so, completing the data encryption, otherwise, returning to S2-3-1-5;
s3-3, when the key iteration state is multiple iterations, performing direct encryption processing on data to be encrypted by using an iteration key pool, and then performing multiple iteration improvement processing to complete data encryption processing;
the direct encryption processing is to encrypt data to be encrypted after carrying out key division by using candidate quantum random numbers of an iterative key pool, and divide the quantum key which is encrypted into a used quantum key pool; the encryption requirement is to complete single complete encryption of the current data to be encrypted.
S3-3 specifically comprises:
s3-3-1, when the data to be encrypted is subjected to direct encryption processing, acquiring a used quantum random number corresponding to each used quantum key of a used quantum key pool in an iteration key pool as a quantum random number to be improved;
s3-3-2, utilizing the quantum random number to be improved to obtain an improved quantum random number based on a square neutralization method;
s3-3-3, combining the improved quantum random number with the candidate quantum random number in the candidate quantum random number pool in the iterative key pool to be used as an update initialization quantum random number;
s3-3-4, and returning to S2-1 by utilizing the updated initialization quantum random number.
In this embodiment, a data iterative encryption processing method for an offline data end, an implementation code of the square extraction method is as follows:
seed = 2333
def random():
global seed
seed = seed ** 2
return int(str(seed)[1:10])
in this embodiment, a method for performing iterative encryption processing on data at an offline data end is implemented by returning to processing through steps in different states of a key or a key pool.
In this embodiment, an encryption result is verified in a multiple iteration manner by using a data iterative encryption processing method for an offline data end, and meanwhile, a basic encryption condition is reassigned to a result which does not meet a verification condition, so that an updated encryption condition is implemented in the offline data end.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical aspects of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the above embodiments, it should be understood by those of ordinary skill in the art that: modifications and equivalents may be made to the specific embodiments of the invention without departing from the spirit and scope of the invention, which is intended to be covered by the claims.
Claims (10)
1. A data iterative encryption processing method for an offline data terminal, comprising:
s1, carrying out key initialization filling treatment on an offline data terminal;
s2, acquiring a real-time key iteration state in the offline data terminal;
and S3, carrying out data encryption processing according to the real-time key iteration state.
2. The method for performing iterative encryption processing on data of an offline data terminal according to claim 1, wherein the performing the key initialization filling processing on the offline data terminal comprises:
generating a quantum random number by using a quantum random number generator as an initialized quantum random number;
and carrying out key initialization filling processing on the offline data terminal by using the initialization quantum random number.
3. The method for data iterative encryption processing of an offline data terminal according to claim 1, wherein obtaining the real-time key iteration state in the offline data terminal comprises:
s2-1, dividing and processing by using an initialization quantum random number in an offline data end to obtain an initialization quantum key;
s2-2, establishing an iterative key pool by using the initialization quantum key;
s2-3, obtaining a real-time key iteration state according to the iteration key pool;
the initialization quantum random number and the initialization quantum key are not completely corresponding.
4. The method for data iterative encryption processing of an offline data terminal according to claim 3, wherein the dividing processing by using the initialized quantum random number in the offline data terminal to obtain the initialized quantum key comprises:
dividing the initialized quantum random number according to the data to be encrypted to obtain a quantum key corresponding to the data to be encrypted;
obtaining a redundant quantum random number of the initialized quantum random number according to the quantum key corresponding to the data to be encrypted;
performing secondary division processing according to the data to be encrypted by using the redundant quantum random number to obtain a backup quantum key corresponding to the data to be encrypted;
using the quantum key corresponding to the data to be encrypted and the backup quantum key corresponding to the data to be encrypted as initialization quantum keys;
the quantum key corresponding to the data to be encrypted is used for data encryption processing, and the backup quantum key corresponding to the data to be encrypted is used for key supplementing backup.
5. A method for data iterative encryption processing at an offline data end as claimed in claim 3, wherein establishing an iterative key pool using the initialization quantum key comprises:
obtaining the rest quantum random numbers of the initialization quantum random numbers as candidate quantum random numbers according to the initialization quantum key;
establishing a candidate quantum random number pool by using the candidate quantum random numbers;
establishing a used quantum key pool by utilizing the initialized quantum key;
and using the used quantum key pool and the candidate quantum random number pool as an iteration key pool.
6. A method for data iterative encryption processing at an offline data end as claimed in claim 3, wherein obtaining the real-time key iteration status from the iterative key pool comprises:
s2-3-1, judging whether a candidate quantum random number pool in the iterative key pool meets the minimum dividing requirement, if so, not processing, otherwise, carrying out reassignment processing by using the used quantum key pool and the candidate quantum random number pool in the iterative key pool to obtain reassigned results;
s2-3-2, when the candidate quantum random number pool in the iteration key pool meets the minimum requirement of division, the real-time key iteration state is no iteration;
s2-3-3, when a candidate quantum random number pool in an iteration key pool does not meet the minimum dividing requirement, judging whether all quantum keys of the initialization quantum key meet the minimum dividing requirement, if so, starting backup quantum key supplementation of the initialization quantum key to a quantum key corresponding to data to be encrypted to obtain a real-time key iteration state, and otherwise, obtaining the real-time key iteration state according to a reassignment processing result;
the minimum dividing requirement is that the quantum random numbers in the candidate quantum random number pool are divided into complete quantum keys according to the data to be encrypted.
7. The method for data iterative encryption processing of an offline data terminal of claim 6, wherein reassigning the used quantum key pool and the candidate quantum random number pool in the iterative key pool to obtain reassigned results comprises:
s2-3-1-1, acquiring a used quantum key with the longest existing time in the used quantum key pool;
s2-3-1-2, obtaining a corresponding used quantum random number as a first quantum random number according to the used quantum key with the longest existing time;
s2-3-1-3, obtaining a first conversion quantum random number by utilizing the first quantum random number based on a random number conversion method;
s2-3-1-4, deleting a used quantum key corresponding to the first quantum random number from the used quantum key pool;
s2-3-1-5, acquiring a used quantum key with the longest existing time in a current used quantum key pool as a complementary quantum key;
s2-3-1-6, acquiring a used quantum random number corresponding to the complementary quantum key as a complementary quantum random number;
s2-3-1-7, deleting a used quantum key corresponding to the supplementary quantum key from the used quantum key pool;
s2-3-1-8, judging whether the total length of the first quantum random number and the complementary quantum random number is larger than the total length of the candidate quantum random numbers in the candidate quantum random number pool, if so, performing complementary combining processing according to the first quantum random number by using the complementary quantum random number to obtain an iterative candidate quantum random number, finishing reassigning processing to obtain a reassigning result, otherwise, returning to S2-3-1-5;
the random number conversion method comprises an LCG algorithm and a Meissen rotation algorithm, and the supplementary combination processing is to sequentially insert the supplementary quantum random numbers into the rear parts of corresponding numbers in the first quantum random numbers according to the head and tail numbers of the supplementary quantum random numbers.
8. The method for data iterative encryption processing on an offline data side of claim 6, wherein obtaining the real-time key iteration status based on the reassignment result comprises:
when the corresponding cycle number of the reassignment result is not 1, the real-time key iteration state is multiple iterations;
and when the reassignment result corresponds to the cycle number of 1, the real-time key iteration state is a single iteration.
9. The method for performing data encryption processing on an offline data side according to claim 1, wherein performing data encryption processing according to the real-time key iteration state comprises:
when the key iteration state is no iteration, directly encrypting the data to be encrypted by using an iteration key pool;
when the key iteration state is single iteration, after direct encryption processing is carried out on data to be encrypted by utilizing an iteration key pool, judging whether the direct encryption processing completely meets encryption requirements, if so, completing data encryption processing, otherwise, returning to S2-3-1-5;
when the key iteration state is multiple iterations, performing direct encryption processing on data to be encrypted by using an iteration key pool, and then performing multiple iteration improvement processing to complete data encryption processing;
the direct encryption processing is to encrypt data to be encrypted after carrying out key division by using candidate quantum random numbers of an iterative key pool, and divide the quantum key which is encrypted into a used quantum key pool; the encryption requirement is to complete single complete encryption of the current data to be encrypted.
10. The method for data iterative encryption processing on an offline data side of claim 9, wherein said performing a plurality of iterative improvement processes comprises:
when the data to be encrypted is subjected to direct encryption processing, acquiring a used quantum random number corresponding to each used quantum key of a used quantum key pool in an iteration key pool as a quantum random number to be improved;
obtaining an improved quantum random number based on a square neutralization method by utilizing the quantum random number to be improved;
combining the improved quantum random number with the candidate quantum random number in the candidate quantum random number pool in the iterative key pool to be used as an updated initialization quantum random number;
and returning S2-1 by using the updated initialization quantum random number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310371008.8A CN116089989B (en) | 2023-04-10 | 2023-04-10 | Data iterative encryption processing method for offline data terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310371008.8A CN116089989B (en) | 2023-04-10 | 2023-04-10 | Data iterative encryption processing method for offline data terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116089989A true CN116089989A (en) | 2023-05-09 |
| CN116089989B CN116089989B (en) | 2023-08-01 |
Family
ID=86210503
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310371008.8A Active CN116089989B (en) | 2023-04-10 | 2023-04-10 | Data iterative encryption processing method for offline data terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116089989B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116614232A (en) * | 2023-07-20 | 2023-08-18 | 广东广宇科技发展有限公司 | Nonlinear key updating method for distributed communication |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1458749A (en) * | 2002-05-15 | 2003-11-26 | 深圳市中兴通讯股份有限公司 | Safe quantum communication method |
| CN105337726A (en) * | 2015-04-06 | 2016-02-17 | 安徽问天量子科技股份有限公司 | End-to-end hand-held device encryption method based on quantum cryptography and system |
| US20190097788A1 (en) * | 2017-09-25 | 2019-03-28 | The Boeing Company | Systems and methods for facilitating iterative key generation and data encryption and decryption |
| CN109756325A (en) * | 2017-11-05 | 2019-05-14 | 成都零光量子科技有限公司 | A method of mobile office system safety is promoted using quantum key |
| CN109842442A (en) * | 2017-11-26 | 2019-06-04 | 成都零光量子科技有限公司 | It is a kind of using airport as the quantum key service network and method of regional center |
| CN210693957U (en) * | 2019-09-30 | 2020-06-05 | 南方电网调峰调频发电有限公司信息通信分公司 | Quantum encryption device of PSTN telephone |
| CN114095167A (en) * | 2021-11-24 | 2022-02-25 | 安徽国盾量子云数据技术有限公司 | Quantum key filling method of communication terminal |
| CN115459950A (en) * | 2022-08-08 | 2022-12-09 | 视联动力信息技术股份有限公司 | Iterative encryption method and device |
| CN115567206A (en) * | 2022-09-29 | 2023-01-03 | 中电信量子科技有限公司 | Method and system for realizing encryption and decryption of network data message by quantum distribution key |
| CN115733683A (en) * | 2022-11-15 | 2023-03-03 | 中电信量子科技有限公司 | Method for realizing Ethernet link self-organizing encryption tunnel by adopting quantum key distribution |
| CN115801257A (en) * | 2023-02-13 | 2023-03-14 | 广东广宇科技发展有限公司 | Quantum encryption-based big data secure transmission method |
| CN115913553A (en) * | 2023-03-08 | 2023-04-04 | 广东广宇科技发展有限公司 | Data encryption method based on nonlinear mapping |
-
2023
- 2023-04-10 CN CN202310371008.8A patent/CN116089989B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1458749A (en) * | 2002-05-15 | 2003-11-26 | 深圳市中兴通讯股份有限公司 | Safe quantum communication method |
| CN105337726A (en) * | 2015-04-06 | 2016-02-17 | 安徽问天量子科技股份有限公司 | End-to-end hand-held device encryption method based on quantum cryptography and system |
| US20190097788A1 (en) * | 2017-09-25 | 2019-03-28 | The Boeing Company | Systems and methods for facilitating iterative key generation and data encryption and decryption |
| CN109560924A (en) * | 2017-09-25 | 2019-04-02 | 波音公司 | Convenient for the generation of iteration key and the system and method for data encryption and decryption |
| CN109756325A (en) * | 2017-11-05 | 2019-05-14 | 成都零光量子科技有限公司 | A method of mobile office system safety is promoted using quantum key |
| CN109842442A (en) * | 2017-11-26 | 2019-06-04 | 成都零光量子科技有限公司 | It is a kind of using airport as the quantum key service network and method of regional center |
| CN210693957U (en) * | 2019-09-30 | 2020-06-05 | 南方电网调峰调频发电有限公司信息通信分公司 | Quantum encryption device of PSTN telephone |
| CN114095167A (en) * | 2021-11-24 | 2022-02-25 | 安徽国盾量子云数据技术有限公司 | Quantum key filling method of communication terminal |
| CN115459950A (en) * | 2022-08-08 | 2022-12-09 | 视联动力信息技术股份有限公司 | Iterative encryption method and device |
| CN115567206A (en) * | 2022-09-29 | 2023-01-03 | 中电信量子科技有限公司 | Method and system for realizing encryption and decryption of network data message by quantum distribution key |
| CN115733683A (en) * | 2022-11-15 | 2023-03-03 | 中电信量子科技有限公司 | Method for realizing Ethernet link self-organizing encryption tunnel by adopting quantum key distribution |
| CN115801257A (en) * | 2023-02-13 | 2023-03-14 | 广东广宇科技发展有限公司 | Quantum encryption-based big data secure transmission method |
| CN115913553A (en) * | 2023-03-08 | 2023-04-04 | 广东广宇科技发展有限公司 | Data encryption method based on nonlinear mapping |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116614232A (en) * | 2023-07-20 | 2023-08-18 | 广东广宇科技发展有限公司 | Nonlinear key updating method for distributed communication |
| CN116614232B (en) * | 2023-07-20 | 2023-10-27 | 广东广宇科技发展有限公司 | Nonlinear key updating method for distributed communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116089989B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7856102B2 (en) | Methods and apparatus for providing a message authentication code using a pipeline | |
| CN110557245A (en) | method and system for fault tolerant and secure multi-party computation of SPDZ | |
| Ohrimenko et al. | The Melbourne shuffle: Improving oblivious storage in the cloud | |
| US20170373832A1 (en) | Methods and devices against a side-channel analysis | |
| CN108964872B (en) | Encryption method and device based on AES | |
| US11431491B2 (en) | Protection of the execution of cipher algorithms | |
| CN111512589A (en) | Method for fast secure multi-party inner product using SPDZ | |
| CN116089989B (en) | Data iterative encryption processing method for offline data terminal | |
| Wang et al. | Accelerating leveled fully homomorphic encryption using GPU | |
| CN113297606A (en) | Color quantum image encryption and decryption method based on multiple chaos and DNA operation | |
| CN115801257A (en) | Quantum encryption-based big data secure transmission method | |
| CN114221766B (en) | Data encryption method, data decryption method and data encryption device | |
| CN100583754C (en) | Pseudo-random number generation method | |
| CN113691362A (en) | Bit plane image compression encryption algorithm based on hyperchaotic system and DNA coding | |
| CN112287366A (en) | Data encryption method and device, computer equipment and storage medium | |
| CN117278339B (en) | Data independent transmission verification method based on bidirectional synchronous key pool | |
| US7184546B2 (en) | Method based on an algorithm capable of being graphically implemented to be used for the generation of filtering of data sequences and crytographic applications | |
| CN113452508B (en) | Data encryption method, device, equipment and computer readable storage medium | |
| CN109559269A (en) | A kind of method and terminal of image encryption | |
| CN109951282B (en) | Pseudo-random sequence generation method based on segmented CUBIC chaotic mapping | |
| CN111638866A (en) | Random number generation method, device, equipment and storage medium | |
| Alipour et al. | A secure image encryption architecture based on pseudorandom number generator and chaotic logistic map | |
| Iavich et al. | Investigating CRYSTALS-Kyber Vulnerabilities: Attack Analysis and Mitigation | |
| CN117527447B (en) | Secret sharing method and system for multiparty secure computation | |
| US11956345B2 (en) | DPA-resistant key derivation function |
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 |