[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN113127911A - Electric power data encryption method and device and terminal - Google Patents

Electric power data encryption method and device and terminal Download PDF

Info

Publication number
CN113127911A
CN113127911A CN202110491904.9A CN202110491904A CN113127911A CN 113127911 A CN113127911 A CN 113127911A CN 202110491904 A CN202110491904 A CN 202110491904A CN 113127911 A CN113127911 A CN 113127911A
Authority
CN
China
Prior art keywords
key
digit
bit
key number
representing
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
Application number
CN202110491904.9A
Other languages
Chinese (zh)
Other versions
CN113127911B (en
Inventor
辛锐
陈曦
吴军英
康之增
张肖杰
郑涛
常永娟
孙思思
刘明硕
杨力平
赵梦瑶
王新颖
邵绪强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
North China Electric Power University
Information and Telecommunication Branch of State Grid Hebei Electric Power Co Ltd
Original Assignee
North China Electric Power University
Information and Telecommunication Branch of State Grid Hebei Electric Power Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by North China Electric Power University, Information and Telecommunication Branch of State Grid Hebei Electric Power Co Ltd filed Critical North China Electric Power University
Priority to CN202110491904.9A priority Critical patent/CN113127911B/en
Publication of CN113127911A publication Critical patent/CN113127911A/en
Application granted granted Critical
Publication of CN113127911B publication Critical patent/CN113127911B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Energy or water supply
    • 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
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
    • Y04S40/20—Information technology specific aspects, e.g. CAD, simulation, modelling, system security

Landscapes

  • Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Water Supply & Treatment (AREA)
  • Public Health (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Bioethics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

The invention is suitable for the technical field of encryption and provides a method, a device and a terminal for encrypting electric power data. Wherein the method comprises the following steps: acquiring a digital disc with a preset size and target power data; selecting a unique number at a random position on the unique number disc as a 1 st-bit unique number, and calculating a 1 st-bit key number based on the position information and the numerical value of the 1 st-bit unique number; determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; calculating the (N + i) th bit key number according to the i th bit key number and the position information and the numerical value of the (N + i) th bit sudoku number; generating a first key and a second key; the target power data is triple DES encrypted based on the first key and the second key. The invention ensures that the secret key has higher security, simple calculation and convenient storage, and solves the problems of low practicability and security of the existing electric power data encryption method.

Description

Electric power data encryption method and device and terminal
Technical Field
The invention belongs to the technical field of encryption, and particularly relates to a method, a device and a terminal for encrypting electric power data.
Background
At present, in order to ensure the security of power data, the power data needs to be encrypted in acquisition, transmission and processing, and the existing encryption methods include a power data security protection method based on a block chain, a power data security protection method based on a cloud computing technology, and a power data encryption method based on a proprietary 4G network.
However, these methods are complex in principle and difficult to implement for general applications. For example, a block chain-based power data security protection method needs to establish a plurality of data model architectures, service interfaces, service application subsystems and a plurality of data nodes, and thus the calculation amount is large; the power data security protection method based on the cloud computing technology has the advantages that a cloud computing application mode has a virtualized environment, stored data are highly aggregated and have high mobility, data control storage and use are in a separated state, abuse and leakage of the data are likely to be caused due to the fact that the data are placed in a cloud storage space, and the security is not high; the power data encryption method based on the proprietary 4G network requires the establishment of a proprietary communication module, a network module and a power server, which is very costly.
Disclosure of Invention
In view of this, the present invention provides a power data encryption method, device and terminal, so as to solve the problem that the power data encryption method is not high in practicability and security.
A first aspect of an embodiment of the present invention provides a power data encryption method, including:
acquiring a digital disc with a preset size and target power data;
selecting a unique number at a random position on the unique number disc as a 1 st-bit unique number, and calculating a 1 st-bit key number based on the position information and the numerical value of the 1 st-bit unique number;
taking the 1 st bit key number as a current bit key number, and taking the 1 st bit number as a current bit number;
determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; repeating the steps until an Nth key number is obtained;
acquiring an N + i-th digital independent number from the digital independent disc, and calculating the N + i-th key number according to the i-th key number and the position information and the numerical value of the N + i-th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
generating a first key based on the 1 st bit key number to the nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2N nd bit key number;
and carrying out triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data.
Optionally, the location information includes a palace and a number;
calculating the 1 st key digit based on the position information and the value of the 1 st digit number comprises:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1Palace, y, representing the 1 st digit of a single number1Number representing the 1 st digit of a figure1A value representing the 1 st digit of the suggestive number.
Optionally, the location information includes a palace and a number;
determining the next unique digit and the next key digit based on the current key digit, the position information and the value of the current unique digit comprises:
taking the numerical value of the current digit unique number as the next digit unique number;
performing remainder calculation on the current bit key number, and taking the calculation result as the number of the next bit unique number;
determining the numerical value of the next-digit unique number based on the palace of the next-digit unique number and the number of the next-digit unique number;
calculate key n]＝xn×yn×anGet the next key number, where key [ n ]]Representing the nth key number, xnPalace, y, representing the nth digit of a single numbernNumber representing the nth digit, anA value representing the nth digit of the suggestive number.
Optionally, the location information includes a palace and a number;
calculating the (N + i) th bit key number according to the i th bit key number, the position information and the value of the (N + i) th bit unique number, wherein the step of calculating the (N + i) th bit key number comprises the following steps:
calculate key [ N + i ]]＝(xN+i+yN+i)×aN+i+key[i]Wherein key [ N + i ]]Representing the N + i-th bit key number, key [ i ]]Representing the ith key number, xN+iPalace, y, representing the (N + i) -th digitN+iNumber representing the (N + i) -th digit, aN+iA numerical value representing the N + i-th digit.
Optionally, generating the first key based on the 1 st bit key number to the nth bit key number, and generating the second key based on the N +1 th bit key number to the 2 nd N bit key number includes:
respectively converting the 1 st bit key number to the Nth bit key number into binary numbers to obtain a first key;
and respectively converting the (N + 1) th bit key number to the (2N) th bit key number into binary numbers to obtain a second key.
Optionally, before generating the first key based on the 1 st bit key number to the nth bit key number and generating the second key based on the N +1 th bit key number to the 2 nd N bit key number, the method further includes:
respectively judging whether the 1 st bit key number to the 2 nd bit key number are more than 2MIf it is, it will be greater than 2MKey number pair 2MPerforming remainder calculation, and updating the corresponding key number by adopting a remainder result; wherein the length of the first key and the length of the second key are both N M.
A second aspect of an embodiment of the present invention provides an electric power data encryption apparatus, including:
the acquisition module is used for acquiring a digital disc with a preset size and target power data;
the selecting module is used for selecting a unique number at a random position on the unique number disc as a 1 st unique number and calculating a 1 st key number based on the position information and the numerical value of the 1 st unique number;
the updating module is used for taking the 1 st bit key digit as a current bit key digit and taking the 1 st bit sudoku digit as a current bit sudoku digit;
the first key calculation module is used for determining the next-digit unique number and the next-digit key number based on the current-digit key number, the position information and the numerical value of the current-digit unique number; repeating the steps until an Nth key number is obtained;
the second key calculation module is used for acquiring the (N + i) th digital independent number from the digital independent disc and calculating the (N + i) th digital key number according to the (i) th digital key number and the position information and the value of the (N + i) th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
the conversion module is used for generating a first key based on the 1 st bit key number to the N th bit key number and generating a second key based on the N +1 th bit key number to the 2N th bit key number;
and the encryption module is used for carrying out triple DES encryption on the target power data based on the first secret key and the second secret key to obtain encrypted data.
Optionally, the location information includes a palace and a number;
the selection module is further configured to:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1Palace, y, representing the 1 st digit of a single number1Number representing the 1 st digit of a figure1A value representing the 1 st digit of the suggestive number.
Optionally, the location information includes a palace and a number;
the first key calculation module includes:
the first position calculation unit is used for taking the numerical value of the current digit unique number as the palace of the next digit unique number;
the second position calculation unit is used for carrying out remainder calculation on the current key number and taking the calculation result as the number of the next unique number;
the numerical value determining unit is used for determining the numerical value of the next-digit unique number based on the palace of the next-digit unique number and the number of the next-digit unique number;
a first key number calculation unit for calculating key n]＝xn×yn×anGet the next key number, where key [ n ]]Representing the nth key number, xnPalace, y, representing the nth digit of a single numbernNumber representing the nth digit, anA value representing the nth digit of the suggestive number.
Optionally, the location information includes a palace and a number;
the second key calculation module includes:
second keyA digital calculation unit for calculating key [ N + i ]]＝(xN+i+YN+i)×aN+i+key[i]Wherein key [ N + i ]]Representing the N + i-th bit key number, key [ i ]]Representing the ith key number, xN+iPalace, y, representing the (N + i) -th digitN+iNumber representing the (N + i) -th digit, aN+iA numerical value representing the N + i-th digit.
Optionally, the conversion module includes:
the first conversion unit is used for converting the 1 st bit key number to the N th bit key number into binary numbers respectively to obtain a first key;
and the second conversion unit is used for converting the (N + 1) th bit key number to the (2N) th bit key number into binary numbers respectively to obtain a second key.
Optionally, the apparatus further comprises:
a checking module for respectively judging whether the 1 st bit key digit to the 2 nd bit key digit are greater than 2 before generating a first key based on the 1 st bit key digit to the N th bit key digit and generating a second key based on the N +1 th bit key digit to the 2 nd bit key digitMIf it is, it will be greater than 2MKey number pair 2MPerforming remainder calculation, and updating the corresponding key number by adopting a remainder result; wherein the length of the first key and the length of the second key are both N M.
A third aspect of embodiments of the present invention provides a terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of any one of the power data encryption methods when executing the computer program.
A fourth aspect of embodiments of the present invention provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the steps of any of the power data encryption methods.
Compared with the prior art, the invention has the following beneficial effects:
the power data encryption method provided by the invention comprises the following steps: acquiring a digital disc with a preset size and target power data; selecting a unique number at a random position on the unique number disc as a 1 st-bit unique number, and calculating a 1 st-bit key number based on the position information and the numerical value of the 1 st-bit unique number; taking the 1 st bit key number as a current bit key number, and taking the 1 st bit number as a current bit number; determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; repeating the steps until an Nth key number is obtained; acquiring an N + i-th digital independent number from the digital independent disc, and calculating the N + i-th key number according to the i-th key number and the position information and the numerical value of the N + i-th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number; generating a first key based on the 1 st bit key number to the nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2N nd bit key number; and carrying out triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data. The invention determines the next key number and the next unique number on the basis of each unique number and key number until obtaining the first key and the second key, and utilizes the characteristic that the numbers in the independent disks can not appear repeatedly, so that the key has higher safety, simple calculation and convenient storage, and solves the problems of low practicability and safety of the traditional electric power data encryption method.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart of an implementation of a power data encryption method provided by an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an electric power data encryption device according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a terminal provided in an embodiment of the present invention;
FIG. 4 is a schematic diagram of a structure of a disk used in an embodiment of the present invention;
fig. 5 is another structural diagram of a disk used in an embodiment of the present invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following description is made by way of specific embodiments with reference to the accompanying drawings.
Referring to fig. 1, it shows a flowchart of an implementation of the power data encryption method provided by the embodiment of the present invention, which is detailed as follows:
step 101, acquiring a digital disc with a preset size and target power data;
in this embodiment, the size of the sudoku disc may be 9 × 9, that is, the sudoku disc includes 9 × 9 unit cells, wherein nine cells are provided in each horizontal row in the horizontal direction, which is called a row, nine cells are provided in each vertical column in the vertical direction, which is called a column, and nine unit cells are provided at the intersection of each adjacent three rows and the adjacent three columns, which is called a uterus. Referring to fig. 4 and 5, the sudoku plate in the present embodiment includes nine palaces, each of which includes nine cells, and the nine cells in each palace have corresponding numbers in the form of fig. 5. The sudoku used in this embodiment has a number in the range of 1-9 at each cell, which is the sudoku in this embodiment, the numerical value of the number is the numerical value of the sudoku, and the numbers in the range of 1-9 appear only once in each row, each column and each palace in the sudoku.
The target power data in this embodiment represents raw data that needs to be encrypted, and may be power data that has been encrypted by another method.
102, selecting a sudoku number at a random position on the sudoku disc as a 1 st sudoku number, and calculating a 1 st secret key number based on the position information and the numerical value of the 1 st sudoku number;
in the present embodiment, the 1 st digit number is used to calculate the 1 st digit key number, and the 1 st digit key number is used to constitute a key for encrypting the target power data. The position information indicates the position of each number in the sudoku, which can be a palace and a number, wherein each palace comprises nine numbers, and the unique position of the number in the sudoku can be determined based on the palace and the number of the number. The randomly selecting the 1 st digit only number can be that the palace where the 1 st digit only number is located is randomly determined, then the number of the 1 st digit only number in the corresponding palace is randomly determined, and finally the numerical value of the 1 st digit only number is obtained according to the palace and the number of the 1 st digit only number. In a 9 x 9 size sudoku disc, the 1 st sudoku number has 81 options.
Optionally, the location information includes a palace and a number;
calculating the 1 st key digit based on the position information and the value of the 1 st digit number comprises:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1Palace, y, representing the 1 st digit of a single number1Number representing the 1 st digit of a figure1A value representing the 1 st digit of the suggestive number.
In this embodiment, the palace, the number and the value of the 1 st digit number are multiplied to obtain the 1 st digit key number.
103, taking the 1 st digit key digit as a current digit key digit, and taking the 1 st digit unique digit as a current digit unique digit;
104, determining a next unique digit and a next key digit based on the current key digit, the position information and the numerical value of the current unique digit; repeating the steps until an Nth key number is obtained;
in this embodiment, specifically, the 1 st-bit key number is calculated by the 1 st-bit unique number, then the 2 nd-bit unique number is calculated by the 1 st-bit unique number and the 1 st-bit key number, the 2 nd-bit key number is calculated by the 2 nd-bit unique number, and so on, the nth-bit key number is calculated by the nth-bit unique number, and then the N +1 th-bit unique number is calculated by the nth-bit unique number and the nth-bit key number to calculate the N +1 th-bit key number until the required N key numbers are obtained.
Optionally, the location information includes a palace and a number;
determining the next unique digit and the next key digit based on the current key digit, the position information and the value of the current unique digit comprises:
taking the numerical value of the current digit unique number as the next digit unique number;
performing remainder calculation on the current bit key number, and taking the calculation result as the number of the next bit unique number;
determining the numerical value of the next-digit unique number based on the palace of the next-digit unique number and the number of the next-digit unique number;
calculate key n]＝xn×yn×anGet the next key number, where key [ n ]]Representing the nth key number, xnPalace, y, representing the nth digit of a single numbernNumber representing the nth digit, anA value representing the nth digit of the suggestive number.
In this embodiment, the remainder calculation is performed on the current-digit key number pair 10, the calculation result is used as the number of the next-digit unique number, so that the number is not greater than 9, and if the remainder calculation result is 0, the number of the next-digit unique number is the same as the palace of the next-digit unique number. The number obtained by calculation is combined with the next-digit unique number, so that the numerical value of the next-digit unique number can be determined. And calculating the product of the palace, the number and the numerical value of the next-digit unique number to obtain the next-digit key number.
105, acquiring an N + i-th digital independent number from the digital independent disc, and calculating the N + i-th key number according to the i-th key number and the position information and the numerical value of the N + i-th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
in this embodiment, the calculation steps of the N +1 th to 2N th key numbers are different from those of the 1 st to N th key numbers, but the key numbers of the corresponding positions in the second key are calculated based on each key number in the first key in the order of the key numbers.
Optionally, the location information includes a palace and a number;
calculating the (N + i) th bit key number according to the i th bit key number, the position information and the value of the (N + i) th bit unique number, wherein the step of calculating the (N + i) th bit key number comprises the following steps:
calculate key [ N + i ]]＝(xN+i+yN+i)×aN+i+key[i]Wherein key [ N + i ]]Representing the N + i-th bit key number, key [ i ]]Representing the ith key number, xN+iPalace, y, representing the (N + i) -th digitN+iNumber representing the (N + i) -th digit, aN+iA numerical value representing the N + i-th digit.
In this embodiment, the sum of the palace and the serial number of the N + i-th digit number is multiplied by the value of the N + i-th digit number, and then the i-th digit key number is added to obtain the N + i-th digit key number, so that the N + i-th digit key number and the i-th digit key number have a corresponding relationship, that is, the mth digit key used in the first key and the mth digit key used in the second key have a corresponding relationship.
Step 106, generating a first key based on the 1 st bit key number to the Nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2 Nth bit key number;
in the present embodiment, the first key and the second key are the same in length and are both digitally generated from N keys to perform triple DES encryption on the target power data.
Optionally, generating the first key based on the 1 st bit key number to the nth bit key number, and generating the second key based on the N +1 th bit key number to the 2 nd N bit key number includes:
respectively converting the 1 st bit key number to the Nth bit key number into binary numbers to obtain a first key;
and respectively converting the (N + 1) th bit key number to the (2N) th bit key number into binary numbers to obtain a second key.
In the present embodiment, each key number is a decimal number before conversion, and each key number is converted into a binary number to encrypt binary digitalized information. And arranging the converted key numbers according to the arrangement sequence of the key numbers before conversion to obtain a first key and a second key.
Optionally, before generating the first key based on the 1 st bit key number to the nth bit key number and generating the second key based on the N +1 th bit key number to the 2 nd N bit key number, the method provided in this embodiment further includes:
respectively judging whether the 1 st bit key number to the 2 nd bit key number are more than 2MIf it is, it will be greater than 2MKey number pair 2MPerforming remainder calculation, and updating the corresponding key number by adopting a remainder result; wherein the length of the first key and the length of the second key are both N M.
In this embodiment, the size of the key number is determined to ensure that the converted key lengths are consistent, and after determining and updating each key number, the updated key number is converted into a binary number to obtain the first key and the second key.
In a specific embodiment, the length of the first key and the second key is 56 bits, and the first key and the second key are respectively converted by 7 key numbers, then in order to ensure the length of the first key and the second key, each key number should be converted into a binary number of 8 bits, that is, each key number should not be greater than 28256. And carrying out remainder calculation on the key number pairs 256 which are larger than 256 so that the remainder result is not larger than 256.
And step 107, performing triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data.
In this embodiment, the encryption process of triple DES encryption is: encrypting the target power data for the first time by using a first key; decrypting the target power data encrypted for the first time by using a second key; the decrypted target power data is encrypted for the second time using the first key. The process of decrypting the encrypted data is as follows: decrypting for the first time using the first key; encrypting using a second key; the second decryption is performed using the first key.
According to the method, firstly, the number disk and the target power data with the preset size are obtained; then selecting a sudoku number at a random position on the sudoku disc as a 1 st sudoku number, and calculating a 1 st secret key number based on the position information and the numerical value of the 1 st sudoku number; taking the 1 st bit key number as a current bit key number, and taking the 1 st bit number as a current bit number; determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; repeating the steps until an Nth key number is obtained; acquiring an N + i-th digital independent number from the digital independent disc, and calculating the N + i-th key number according to the i-th key number and the position information and the numerical value of the N + i-th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number; generating a first key based on the 1 st bit key number to the nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2N nd bit key number; and finally, carrying out triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data. The invention determines the next key number and the next unique number on the basis of each unique number and key number until obtaining the first key and the second key, and utilizes the characteristic that the numbers in the independent disks can not appear repeatedly, so that the key has higher safety, simple calculation and convenient storage, and solves the problems of low practicability and safety of the traditional electric power data encryption method.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
The following are embodiments of the apparatus of the invention, reference being made to the corresponding method embodiments described above for details which are not described in detail therein.
Fig. 2 is a schematic structural diagram of a power data encryption device according to an embodiment of the present invention, and for convenience of description, only the parts related to the embodiment of the present invention are shown, and detailed descriptions are as follows:
as shown in fig. 2, the power data encryption device 2 includes:
an obtaining module 21, configured to obtain a raid disk with a preset size and target power data;
the selecting module 22 is configured to select a sudoku at a random position on the sudoku as a 1 st sudoku, and calculate a 1 st key number based on the position information and the numerical value of the 1 st sudoku;
the updating module 23 is configured to use the 1 st bit key number as a current bit key number, and use the 1 st bit sudoku number as a current bit sudoku number;
the first key calculation module 24 is configured to determine a next-digit unique number and a next-digit key number based on the current-digit key number, the position information of the current-digit unique number, and the numerical value; repeating the steps until an Nth key number is obtained;
the second key calculation module 25 is configured to obtain the (N + i) -th sudoku number from the sudoku disc, and calculate the (N + i) -th sudoku number according to the (i) -th sudoku number and the position information and the value of the (N + i) -th sudoku number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
a conversion module 26, configured to generate a first key based on the 1 st bit key number to the nth bit key number, and generate a second key based on the N +1 th bit key number to the 2 nd N bit key number;
and an encryption module 27, configured to perform triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data.
Optionally, the location information includes a palace and a number;
the selecting module 22 is further configured to:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1Palace, y, representing the 1 st digit of a single number1Number representing the 1 st digit of a figure1A value representing the 1 st digit of the suggestive number.
Optionally, the location information includes a palace and a number;
the first key calculation module 24 includes:
the first position calculation unit is used for taking the numerical value of the current digit unique number as the palace of the next digit unique number;
the second position calculation unit is used for carrying out remainder calculation on the current key number and taking the calculation result as the number of the next unique number;
the numerical value determining unit is used for determining the numerical value of the next-digit unique number based on the palace of the next-digit unique number and the number of the next-digit unique number;
a first key number calculation unit for calculating key n]＝xn×yn×anGet the next key number, where key [ n ]]Representing the nth key number, xnPalace, y, representing the nth digit of a single numbernNumber representing the nth digit, anA value representing the nth digit of the suggestive number.
Optionally, the location information includes a palace and a number;
the second key calculation module 25 includes:
a second key number calculation unit for calculating key [ N + i ]]＝(xN+i+YN+i)×aN+i+key[i]Wherein key [ N + i ]]Representing the N + i-th bit key number, key [ i ]]Representing the ith key number, xN+iPalace, y, representing the (N + i) -th digitN+iNumber representing the (N + i) -th digit, aN+iA numerical value representing the N + i-th digit.
Optionally, the conversion module 26 includes:
the first conversion unit is used for converting the 1 st bit key number to the N th bit key number into binary numbers respectively to obtain a first key;
and the second conversion unit is used for converting the (N + 1) th bit key number to the (2N) th bit key number into binary numbers respectively to obtain a second key.
Optionally, the apparatus further comprises:
a checking module 28 for respectively judging whether the 1 st bit key digit to the 2 nd bit key digit are greater than 2 before generating the first key based on the 1 st bit key digit to the N th bit key digit and the second key based on the N +1 th bit key digit to the 2 nd bit key digitMIf it is, it will be greater than 2MKey number pair 2MPerforming remainder calculation, and updating the corresponding key number by adopting a remainder result; wherein the length of the first key and the length of the second key are both N M.
According to the method, firstly, the number disk and the target power data with the preset size are obtained; then selecting a sudoku number at a random position on the sudoku disc as a 1 st sudoku number, and calculating a 1 st secret key number based on the position information and the numerical value of the 1 st sudoku number; taking the 1 st bit key number as a current bit key number, and taking the 1 st bit number as a current bit number; determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; repeating the steps until an Nth key number is obtained; acquiring an N + i-th digital independent number from the digital independent disc, and calculating the N + i-th key number according to the i-th key number and the position information and the numerical value of the N + i-th digital independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number; generating a first key based on the 1 st bit key number to the nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2N nd bit key number; and finally, carrying out triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data. The invention determines the next key number and the next unique number on the basis of each unique number and key number until obtaining the first key and the second key, and utilizes the characteristic that the numbers in the independent disks can not appear repeatedly, so that the key has higher safety, simple calculation and convenient storage, and solves the problems of low practicability and safety of the traditional electric power data encryption method.
Fig. 3 is a schematic diagram of a terminal according to an embodiment of the present invention. As shown in fig. 3, the terminal 3 of this embodiment includes: a processor 30, a memory 31 and a computer program 32 stored in said memory 31 and executable on said processor 30. The processor 30, when executing the computer program 32, implements the steps in the above-mentioned various power data encryption method embodiments, such as the steps 101 to 107 shown in fig. 1. Alternatively, the processor 30, when executing the computer program 32, implements the functions of the modules/units in the above-mentioned device embodiments, such as the functions of the units 21 to 27 shown in fig. 2.
Illustratively, the computer program 32 may be partitioned into one or more modules/units that are stored in the memory 31 and executed by the processor 30 to implement the present invention. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program 32 in the terminal 3. The terminal 3 may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The terminal may include, but is not limited to, a processor 30, a memory 31. It will be appreciated by those skilled in the art that fig. 3 is only an example of a terminal 3 and does not constitute a limitation of the terminal 3 and may comprise more or less components than those shown, or some components may be combined, or different components, e.g. the terminal may further comprise input output devices, network access devices, buses, etc.
The Processor 30 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 31 may be an internal storage unit of the terminal 3, such as a hard disk or a memory of the terminal 3. The memory 31 may also be an external storage device of the terminal 3, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) and the like provided on the terminal 3. Further, the memory 31 may also include both an internal storage unit and an external storage device of the terminal 3. The memory 31 is used for storing the computer program and other programs and data required by the terminal. The memory 31 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus/terminal and method may be implemented in other ways. For example, the above-described apparatus/terminal embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain other components which may be suitably increased or decreased as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media which may not include electrical carrier signals and telecommunications signals in accordance with legislation and patent practice.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present 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 solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims (10)

1. A power data encryption method, comprising:
acquiring a digital disc with a preset size and target power data;
selecting a sudoku number at a random position on the sudoku disc as a 1 st sudoku number, and calculating a 1 st secret key number based on the position information and the numerical value of the 1 st sudoku number;
taking the 1 st bit key number as a current bit key number, and taking the 1 st bit unique number as a current bit unique number;
determining a next-digit unique number and a next-digit key number based on the current-digit key number, the position information and the value of the current-digit unique number; repeating the steps until an Nth key number is obtained;
acquiring an N + i-th digital-independent number from the digital-independent disc, and calculating the N + i-th key number according to the i-th key number, the position information and the numerical value of the N + i-th digital-independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
generating a first key based on the 1 st bit key number to the nth bit key number, and generating a second key based on the (N + 1) th bit key number to the 2N nd bit key number;
and performing triple DES encryption on the target power data based on the first key and the second key to obtain encrypted data.
2. The power data encryption method according to claim 1, wherein the position information includes a palace and a number;
the calculating the 1 st key digit based on the position information and the value of the 1 st digit comprises:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1A palace, y, representing said 1 st digit only1Number representing said 1 st digit, a1A value representing the 1 st digit of the suggestive number.
3. The power data encryption method according to claim 1, wherein the position information includes a palace and a number;
the determining the next unique digit and the next key digit based on the current key digit, the position information and the value of the current unique digit comprises:
taking the numerical value of the current digit unique number as the next digit unique number;
performing remainder calculation on the current bit key number, and taking the calculation result as the number of the next bit unique number;
determining the numerical value of the next-digit unique number based on the palace of the next-digit unique number and the number of the next-digit unique number;
calculate key n]＝xn×yn×anGet the next key number, where key [ n ]]Representing the nth key number, xnA palace, y, representing said nth digit only numbernNumber representing said nth digit, anA value representing the nth digit number.
4. The power data encryption method according to claim 1, wherein the position information includes a palace and a number;
the calculating the (N + i) th bit key number according to the i th bit key number, the position information and the numerical value of the (N + i) th bit unique number comprises:
calculate key [ N + i ]]＝(xN+i+yN+i)×aN+i+key[i]Wherein key [ N + i ]]Representing the N + i-th bit key number, key [ i ]]Representing the ith key number, xN+iPalace, y, representing the (N + i) -th digitN+iNumber representing the (N + i) -th digit, aN+iA numerical value representing the N + i-th digit.
5. The power data encryption method according to any one of claims 1 to 4, wherein the generating a first key based on the 1 st bit key number to the N th bit key number, and the generating a second key based on the N +1 th bit key number to the 2N th bit key number includes:
respectively converting the 1 st bit key number to the Nth bit key number into binary numbers to obtain a first key;
and respectively converting the (N + 1) th bit key number to the (2N) th bit key number into binary numbers to obtain a second key.
6. The power data encryption method according to claim 5, wherein before generating the first key based on the 1 st bit key number to the nth bit key number and generating the second key based on the N +1 th bit key number to the 2N bit key number, the method further comprises:
respectively judging whether the 1 st bit key number to the 2N bit key number are more than 2MIf it is, it will be greater than 2MKey number pair 2MPerforming remainder calculation, and updating the corresponding key number by adopting a remainder result; wherein the length of the first key and the length of the second key are both N M.
7. An electric power data encryption device, characterized by comprising:
the acquisition module is used for acquiring a digital disc with a preset size and target power data;
the selecting module is used for selecting a sudoku number at a random position on the sudoku disc as a 1 st sudoku number and calculating a 1 st secret key number based on the position information and the numerical value of the 1 st sudoku number;
the updating module is used for taking the 1 st bit key digit as a current bit key digit and taking the 1 st bit unique digit as a current bit unique digit;
the first key calculation module is used for determining the next-digit unique number and the next-digit key number based on the current-digit key number, the position information and the numerical value of the current-digit unique number; repeating the steps until an Nth key number is obtained;
the second key calculation module is used for acquiring the (N + i) th digital-independent number from the digital-independent disc and calculating the (N + i) th digital-independent number according to the (i) th digital-independent number, the position information and the numerical value of the (N + i) th digital-independent number; i belongs to [1, N ]; repeating the steps to obtain the (N + 1) th bit key number to the (2N) th bit key number;
the conversion module is used for generating a first key based on the 1 st bit key number to the N th bit key number and generating a second key based on the N +1 th bit key number to the 2N th bit key number;
and the encryption module is used for carrying out triple DES encryption on the target power data based on the first secret key and the second secret key to obtain encrypted data.
8. The power data encryption device according to claim 7, wherein the position information includes a palace and a number;
the selection module is specifically configured to:
calculate key [1 ]]＝x1×y1×a1To obtain the 1 st key number, where key [1 ]]Representing the 1 st key number, x1A palace, y, representing said 1 st digit only1Number representing said 1 st digit, a1A value representing the 1 st digit of the suggestive number.
9. A terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the power data encryption method as claimed in any one of claims 1 to 6 above when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the power data encryption method according to any one of claims 1 to 6 above.
CN202110491904.9A 2021-05-06 2021-05-06 Power data encryption method, device and terminal Active CN113127911B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110491904.9A CN113127911B (en) 2021-05-06 2021-05-06 Power data encryption method, device and terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110491904.9A CN113127911B (en) 2021-05-06 2021-05-06 Power data encryption method, device and terminal

Publications (2)

Publication Number Publication Date
CN113127911A true CN113127911A (en) 2021-07-16
CN113127911B CN113127911B (en) 2022-05-20

Family

ID=76781436

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110491904.9A Active CN113127911B (en) 2021-05-06 2021-05-06 Power data encryption method, device and terminal

Country Status (1)

Country Link
CN (1) CN113127911B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114021174A (en) * 2021-11-16 2022-02-08 山石网科通信技术股份有限公司 Data encryption method and device and data decryption method and device
CN114531239A (en) * 2022-04-20 2022-05-24 广州万协通信息技术有限公司 Data transmission method and system for multiple encryption keys

Citations (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1402920A (en) * 1999-11-29 2003-03-12 通用仪器公司 Generation of mathematically constrained key using one-way function
CN1701294A (en) * 2002-01-16 2005-11-23 因芬尼昂技术股份公司 Calculation unit and method for performing arithmetic operations with encrypted operands
US20080065440A1 (en) * 2006-09-08 2008-03-13 Ben Graham Methods for estimating search engine market share for websites
US20120134491A1 (en) * 2010-11-29 2012-05-31 Beijing Z & W Technology Consulting Co., Ltd Cloud Storage Data Encryption Method, Apparatus and System
CN103093127A (en) * 2013-01-21 2013-05-08 深圳大学 Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks
CN103544674A (en) * 2013-10-16 2014-01-29 大连理工大学 Method for progressively encrypting and sharing secrete images on basis of Sudoku
US9224000B1 (en) * 2011-06-14 2015-12-29 Ionic Security, Inc. Systems and methods for providing information security using context-based keys
CN107707347A (en) * 2017-10-27 2018-02-16 深圳市文鼎创数据科技有限公司 The backup method and device of user key, the introduction method and device of user key
CN108305298A (en) * 2018-01-17 2018-07-20 湖北工业大学 A kind of image based on the only matrix index of number can restore information concealing method
CN109005196A (en) * 2018-09-10 2018-12-14 北京旷视科技有限公司 Data transmission method, data decryption method, device and electronic equipment
CN109104279A (en) * 2018-08-31 2018-12-28 国网河北省电力有限公司沧州供电分公司 A kind of encryption method of electric power data, system and terminal device
CN109543370A (en) * 2017-09-22 2019-03-29 西安中兴新软件有限责任公司 A kind of application processing method, terminal and computer readable storage medium
CN110457916A (en) * 2019-07-19 2019-11-15 平安科技（深圳）有限公司 An electronic contract encryption method, device and terminal device
US20190394031A1 (en) * 2018-01-11 2019-12-26 Beijing Guodian Tong Network Technology Co., Ltd Method and device for quantum key fusion-based virtual power plant security communication and medium
CN110839026A (en) * 2019-11-12 2020-02-25 深圳市网心科技有限公司 Blockchain-based data processing method and related equipment
CN110930824A (en) * 2018-09-19 2020-03-27 太翌信息技术(上海)有限公司 Artificial intelligence big data nine-grid arithmetic system
CN111614692A (en) * 2020-05-28 2020-09-01 广东纬德信息科技股份有限公司 Inbound message processing method and device based on power gateway
CN111654707A (en) * 2020-06-03 2020-09-11 福建师范大学福清分校 A Tetris-based Information Hiding Method and Terminal
CN111984982A (en) * 2020-08-26 2020-11-24 厦门大学 Method for hiding information, electronic equipment and computer readable storage medium

Patent Citations (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1402920A (en) * 1999-11-29 2003-03-12 通用仪器公司 Generation of mathematically constrained key using one-way function
CN1701294A (en) * 2002-01-16 2005-11-23 因芬尼昂技术股份公司 Calculation unit and method for performing arithmetic operations with encrypted operands
US20080065440A1 (en) * 2006-09-08 2008-03-13 Ben Graham Methods for estimating search engine market share for websites
US20120134491A1 (en) * 2010-11-29 2012-05-31 Beijing Z & W Technology Consulting Co., Ltd Cloud Storage Data Encryption Method, Apparatus and System
US9224000B1 (en) * 2011-06-14 2015-12-29 Ionic Security, Inc. Systems and methods for providing information security using context-based keys
CN103093127A (en) * 2013-01-21 2013-05-08 深圳大学 Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks
CN103544674A (en) * 2013-10-16 2014-01-29 大连理工大学 Method for progressively encrypting and sharing secrete images on basis of Sudoku
CN109543370A (en) * 2017-09-22 2019-03-29 西安中兴新软件有限责任公司 A kind of application processing method, terminal and computer readable storage medium
CN107707347A (en) * 2017-10-27 2018-02-16 深圳市文鼎创数据科技有限公司 The backup method and device of user key, the introduction method and device of user key
US20190394031A1 (en) * 2018-01-11 2019-12-26 Beijing Guodian Tong Network Technology Co., Ltd Method and device for quantum key fusion-based virtual power plant security communication and medium
CN108305298A (en) * 2018-01-17 2018-07-20 湖北工业大学 A kind of image based on the only matrix index of number can restore information concealing method
CN109104279A (en) * 2018-08-31 2018-12-28 国网河北省电力有限公司沧州供电分公司 A kind of encryption method of electric power data, system and terminal device
CN109005196A (en) * 2018-09-10 2018-12-14 北京旷视科技有限公司 Data transmission method, data decryption method, device and electronic equipment
CN110930824A (en) * 2018-09-19 2020-03-27 太翌信息技术(上海)有限公司 Artificial intelligence big data nine-grid arithmetic system
CN110457916A (en) * 2019-07-19 2019-11-15 平安科技（深圳）有限公司 An electronic contract encryption method, device and terminal device
CN110839026A (en) * 2019-11-12 2020-02-25 深圳市网心科技有限公司 Blockchain-based data processing method and related equipment
CN111614692A (en) * 2020-05-28 2020-09-01 广东纬德信息科技股份有限公司 Inbound message processing method and device based on power gateway
CN111654707A (en) * 2020-06-03 2020-09-11 福建师范大学福清分校 A Tetris-based Information Hiding Method and Terminal
CN111984982A (en) * 2020-08-26 2020-11-24 厦门大学 Method for hiding information, electronic equipment and computer readable storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
肖波 等: ""数独高效随机生成算法的研究与实现"", 《电脑知识与技术》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114021174A (en) * 2021-11-16 2022-02-08 山石网科通信技术股份有限公司 Data encryption method and device and data decryption method and device
CN114531239A (en) * 2022-04-20 2022-05-24 广州万协通信息技术有限公司 Data transmission method and system for multiple encryption keys

Also Published As

Publication number Publication date
CN113127911B (en) 2022-05-20

Similar Documents

Publication Publication Date Title
Li et al. Novel image encryption algorithm based on improved logistic map
Zhang et al. Image encryption algorithm based on quantum chaotic map and DNA coding
Persohn et al. Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation
CN111008863B (en) Lottery drawing method and system based on block chain
Liu et al. Image encryption using DNA complementary rule and chaotic maps
CN109493875B (en) Audio watermark adding and extracting method and terminal equipment
CN107707347B (en) User key backup method and device and user key importing method and device
CN109756322B (en) Digital Image Encryption Method Based on DES Structure and DNA Encoding
Feng et al. Cryptanalysis of the integrated chaotic systems based image encryption algorithm
CN109547201B (en) Encryption method of root key, computer readable storage medium and terminal equipment
CN113127911A (en) Electric power data encryption method and device and terminal
Xue et al. Medical image protection algorithm based on deoxyribonucleic acid chain of dynamic length
Shashidhar et al. Design of high speed AES system for efficient data encryption and decryption system using FPGA
CN116484395A (en) Security calculation method based on privacy data and related equipment
CN110225222B (en) Image encryption method based on 3D orthogonal Latin square and chaotic system
Anghelescu Encryption algorithm using programmable cellular automata
CN110515591B (en) Random number generation method and device based on block chain
CN113902135A (en) Method, device, device, system and storage medium for joint expansion of sample data volume
US11228432B2 (en) Quantum-resistant cryptoprocessing
CN109309562A (en) Encrypt Algorithm of Irrational Number
CN114614973B (en) Method, device, equipment and storage medium for obtaining block cipher differentiator
Zefreh et al. Image security system using recursive cellular automata substitution and its parallelization
RU2503135C1 (en) Method for cryptographic transformation of information and apparatus for realising said method
CN115333868A (en) Symmetric encryption method, symmetric decryption method, symmetric encryption device, symmetric decryption device and symmetric encryption equipment based on odd-even round robin
CN114978465A (en) Encryption method based on exponential amplifier and improved Zigzag transformation

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