CN110071927A - A kind of information ciphering method, system and associated component - Google Patents
A kind of information ciphering method, system and associated component Download PDFInfo
- Publication number
- CN110071927A CN110071927A CN201910349533.3A CN201910349533A CN110071927A CN 110071927 A CN110071927 A CN 110071927A CN 201910349533 A CN201910349533 A CN 201910349533A CN 110071927 A CN110071927 A CN 110071927A
- Authority
- CN
- China
- Prior art keywords
- key
- word
- sub
- result
- current
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
Abstract
This application discloses a kind of information ciphering method, the information encryption includes determining confidential information and master key coding to be added when receiving encrypted instruction；Master key coding is divided into left side key word and right side key word as unit of half-word, and the confidential information to be added is divided into the first left side coded word and the first right side coded word as unit of half-word；Cipher key spreading is executed according to the left side key word and the right side key word to operate to obtain N group sub-key；XOR operation and mould 2 successively are executed to first left side coded word and first right side coded word using the N group sub-keyMAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.This method can reduce encryption information process occupied memory space under the premise of meeting certain safety.Disclosed herein as well is a kind of information encryption system, a kind of computer readable storage medium and a kind of electronic equipment, have the above beneficial effect.
Description
Technical field
The present invention relates to field of information security technology, in particular to a kind of information ciphering method, system, a kind of computer can
Read storage medium and a kind of electronic equipment.
Background technique
With the extensive use of Internet of Things, many safety relevant to internet of things equipment characteristic of internet of things deployment initiation
Problem is more and more prominent.For Internet of Things, internet of things equipment is easier than connecting the computer of internet by safe prestige
The side of body, this is because the processing capacity of internet of things equipment and memory source are very limited.The autonomous operation and communication of internet of things equipment
Also promote security attack.Therefore, there is an urgent need to the new and security solutions more reinforced for Internet of things system, wherein
Especially prominent is that lightweight encryption algorithm is needed in terms of computing capability and storage inside.
Currently, the non-linear components of most algorithm are using S box in existing grouping algorithm, although having higher
Safety, but its occupied memory space is big, needs to occupy the memory space of 256 bytes if the S box that one 8 goes out into 8, and
For most widely used aes algorithm, the S box possessed just has as many as 16, and memory space occupancy is very big, is not suitable for
In processing capacity and the very limited internet of things equipment of resource.And for meeting certain safety under the premise of, memory space
The simple grouping algorithm of small and structure is very urgent for Internet of Things.
Therefore, how to reduce the occupied memory space of encryption information process under the premise of meeting certain safety is this
The current technical issues that need to address of field technical staff.
Summary of the invention
The purpose of the application is to provide a kind of information ciphering method, system, a kind of computer readable storage medium and one kind
Electronic equipment can reduce encryption information process occupied memory space under the premise of meeting certain safety.
In order to solve the above technical problems, the application provides a kind of information ciphering method, which includes:
When receiving encrypted instruction, confidential information and master key coding to be added is determined；Wherein, the confidential information to be added is bright
Text coding；
Master key coding is divided into left side key word and right side key word as unit of half-word, and will be described to be encrypted
Information is divided into the first left side coded word and the first right side coded word as unit of half-word；
Cipher key spreading is executed according to the left side key word and right side key word to operate to obtain N group sub-key；
Exclusive or successively is executed to first left side coded word and first right side coded word using the N group sub-key
Operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.
Optionally, it is described according to the left side key word and right side key word execute cipher key spreading operate to obtain N number of son it is close
Key includes:
Step 1: by the left side key word and right side key word progress mould 2 after ring shift left A16Add operation obtains
One intermediate key word L1, by the right side key word and the first intermediate key word L1 execution XOR operation after ring shift right B
Operation obtains the second intermediate key word R2；
Step 2: by the first intermediate key word L1 and the second intermediate key word L2 execution mould 2 after ring shift left A16
Add operation obtains the first sub-key KL0, by after ring shift right B right side key word and the first sub-key KL0 execute it is different
Or arithmetic operation obtains the second sub-key KR0；
Step 3: setting one group of sub-key for the first sub-key KL0 and the second sub-key KR0, and record son
The group number of key；
Step 4: judging whether described group of number is greater than N；If it is not, then that the first sub-key KL0 is close as new left side
Key word and using the second sub-key KR0 as new right side key word, enters step 1.
Optionally, successively using the N group sub-key to first left side coded word and first right side coded word
Execute XOR operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added to include:
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set Y=1；Wherein,
The numerical digit for generating time more early sub-key is smaller；
Step 2: using 2 sub-keys numbered as Y as current first sub-key and current second sub-key；
Step 3: first left side coded word and current first sub-key being subjected to XOR operation and obtain the first operation knot
Fruit, and first operation result and first right side coded word are executed into mould 216Add operation obtains the second operation result, will
Second operation result ring shift right C obtains the first intermediate cryptographic as a result, the first right side after ring shift left D is encoded
Word and the first intermediate cryptographic result execute XOR operation and operate to obtain the second intermediate cryptographic result；
Step 4: the first intermediate cryptographic result and the second intermediate cryptographic result are subjected to mould 216Add operation obtains
The third operation result and the current first sub-key execution XOR operation are obtained current first and added by third operation result
It is close to be obtained currently as a result, the first right side coded word after ring shift left A is executed xor operation with current first encrypted result
Second encrypted result；
Step 5: judging whether Y is greater than N；If so, will be according to current first encrypted result and current second encrypted result
It is encoded as to the ciphertext after the confidential information encryption to be added；If it is not, then using current first encrypted result as new the
One left side coded word, and Y plus one is entered step 2 using current second encrypted result as the first new right side coded word；
Optionally, further includes:
After generating the sub-key, the sub-key is stored into corresponding register.
Optionally, further includes:
When receiving the corresponding decryption instructions of ciphertext coding, it is divided into as unit of half-word according to the decryption instructions
Second left side coded word and the second right side coded word；
Exclusive or successively is executed to second left side coded word and second right side coded word using the N group sub-key
Operation and mould 2MAdd operation, obtains the plaintext coding to encode execution decryption processing to the ciphertext.
Optionally, successively using the N group sub-key to second left side coded word and second right side coded word
Execute XOR operation and mould 2MAdd operation, includes: to obtain the plaintext coding to ciphertext coding execution decryption processing
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set X=N；Wherein,
The numerical digit for generating time more early sub-key is smaller, and the numerical digit for generating time identical sub-key is identical；
Step 2: numbering the sub-key for X as current first sub-key and current second sub-key for described；
Step 3: second left side coded word and second right side coded word being executed into XOR operation and obtain the 4th fortune
It calculates as a result, the 4th operation result, which is moved to right A, obtains the second intermediate decrypted result；By second left side coded word and institute
It states current second sub-key progress XOR operation and obtains the 5th operation result, among the 5th operation result and described second
Key word R1 carries out mould 216Add operation obtains the first intermediate decrypted result；
Step 4: the described first intermediate decrypted result and the second intermediate decrypted result being subjected to XOR operation and obtain the
Six operation results obtain current second decrypted result for described 6th operation result ring shift right D；After ring shift left C
The first intermediate decrypted result and current second decrypted result carry out mould 216Add operation obtains the 7th operation result, by the described 7th
Operation result and current first sub-key execute XOR operation and operate to obtain current first decrypted result；
Step 5: judging whether X is equal to 1；If so, will be according to current first decrypted result and current second decrypted result
It is encoded as the plaintext obtained after decryption processing is encoded to the ciphertext；If it is not, then using current first decrypted result as new
Second left side coded word, and using current second decrypted result as the second new right side coded word, X is subtracted one, enters step 2.
Present invention also provides a kind of information encryption system, which includes:
Information determination module, for when receiving encrypted instruction, determining confidential information and master key coding to be added；Wherein,
The confidential information to be added is to encode in plain text；
Division module, for master key coding to be divided into left side key word and right side key word as unit of half-word,
And the confidential information to be added is divided into the first left side coded word and the first right side coded word as unit of half-word；
Cipher key expansion module operates to obtain N for executing cipher key spreading according to the left side key word and right side key word
Group sub-key；
Encrypting module, for successively using the N group sub-key to first left side coded word and first right side
Coded word executes XOR operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.
Optionally, the cipher key expansion module includes:
Intermediate key determination unit, for carrying out the left side key word after ring shift left A with the right side key word
Mould 216Add operation obtains the first intermediate key word L1, by after ring shift right B right side key word and first intermediate key
Word L1 executes XOR operation and operates to obtain the second intermediate key word R2；
Sub-key determination unit, for the first intermediate key word L1 after ring shift left A and second centre is close
Key word L2 executes mould 216Add operation obtains the first sub-key KL0, by the right side key word and first son after ring shift right B
Key KL0 executes XOR operation and operates to obtain the second sub-key KR0；
Sub-key processing unit, for setting one group of son for the first sub-key KL0 and the second sub-key KR0
Key, and record the group number of sub-key；
Judging unit, for judging whether described group of number is greater than N；If it is not, then using the first sub-key KL0 as new
Left side key word and using the second sub-key KR0 as new right side key word, starts the intermediate key determination unit pair
The workflow answered.
Present invention also provides a kind of computer readable storage mediums, are stored thereon with computer program, the computer
The step of above- mentioned information encryption method executes is realized when program executes.
Present invention also provides a kind of electronic equipment, including memory and processor, calculating is stored in the memory
Machine program, the processor realize the step that above- mentioned information encryption method executes when calling the computer program in the memory
Suddenly.
This application provides a kind of information ciphering methods, including when receiving encrypted instruction, determine confidential information to be added and
Master key coding；Wherein, the confidential information to be added is to encode in plain text；Master key coding is divided into left side as unit of half-word
Key word and right side key word, and the confidential information to be added is divided into the first left side coded word and the first right side as unit of half-word
Coded word；Cipher key spreading is executed according to the left side key word and right side key word to operate to obtain N group sub-key；Successively utilize N
The group sub-key executes XOR operation and mould 2 to first left side coded word and first right side coded wordMAdd operation,
To perform encryption processing to obtain ciphertext coding to the confidential information to be added.
Relative in such a way that S box is encrypted, the application is close by N group that cipher key spreading obtains in the related technology
Key successively executes cryptographic operation to the first left side coded word and first right side coded word and obtains ciphertext coding.Further
, since the application is by executing XOR operation and mould 2MOperation is added to realize information encryption, which patrols without complicated operation
Volume, hardware utilization in ciphering process is improved, the requirement to carrier computing capability and memory space is reduced.Therefore, this Shen
It please can reduce encryption information process occupied memory space under the premise of meeting certain safety.The application also mentions simultaneously
A kind of information encryption system, a kind of computer readable storage medium and a kind of electronic equipment have been supplied, there is above-mentioned beneficial effect,
This is repeated no more.
Detailed description of the invention
In ord to more clearly illustrate embodiments of the present application, attached drawing needed in the embodiment will be done simply below
It introduces, it should be apparent that, the drawings in the following description are only some examples of the present application, for ordinary skill people
For member, without creative efforts, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is a kind of flow chart of information ciphering method provided by the embodiment of the present application；
Fig. 2 is a kind of flow chart of information decryption method provided by the embodiment of the present application；
Fig. 3 is the present embodiment integrated circuit structural schematic diagram；
Fig. 4 is the operation inner frame schematic diagram of the present embodiment cipher key spreading circuit each round；
Fig. 5 is the present embodiment encryption and decryption circuit general frame schematic diagram；
Fig. 6 is the inner frame schematic diagram of the operation of each round in the present embodiment enciphering and deciphering algorithm；
Fig. 7 is a kind of structural schematic diagram of information encryption system provided by the embodiment of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall in the protection scope of this application.
Below referring to Figure 1, Fig. 1 is a kind of flow chart of information ciphering method provided by the embodiment of the present application.
Specific steps may include:
S101: when receiving encrypted instruction, confidential information and master key coding to be added is determined；
Wherein, the confidential information to be added is to encode in plain text, and the present embodiment can be applied to the internet of things equipment in Internet of Things,
The executing subject of the present embodiment can be internet of things equipment.Confidential information to be added is the information for needing to be encrypted, to be encrypted
Information exists in the form that plaintext encodes, and the present embodiment does not limit source, purposes and the content of information to be encrypted.
S102: master key coding is divided into left side key word and right side key word as unit of half-word, and will be described
Confidential information to be added is divided into the first left side coded word and the first right side coded word as unit of half-word；
Wherein, master key coding can be a string of characters, and the length of each character is a word, this step can be close by master
Each character is that unit is divided into left side key word and right side key word according to half-word in key, similarly can will be in confidential information to be added
Each character is that unit is divided into the first left side coded word and the first right side coded word according to half-word.
S103: cipher key spreading is executed according to the left side key word and right side key word and operates to obtain N group sub-key；
Wherein, the purpose of the present embodiment is that obtaining multiple groups sub-key by encoding execution cipher key spreading to master key, this
Step is realized on the basis of master key coding is divided into left side key word and right side key word, does not limit N's herein
Numerical values recited.
Specifically, the operation that execution cipher key spreading operates to obtain N group sub-key may comprise steps of:
Step 1: by the left side key word and right side key word progress mould 2 after ring shift left A16Add operation obtains
One intermediate key word L1, by the right side key word and the first intermediate key word L1 execution XOR operation after ring shift right B
Operation obtains the second intermediate key word R2；
Step 2: by the first intermediate key word L1 and the second intermediate key word L2 execution mould 2 after ring shift left A16
Add operation obtains the first sub-key KL0, by after ring shift right B right side key word and the first sub-key KL0 execute it is different
Or arithmetic operation obtains the second sub-key KR0；
Step 3: setting one group of sub-key for the first sub-key KL0 and the second sub-key KR0, and record son
The group number of key；
Step 4: judging whether described group of number is greater than N；If it is not, then that the first sub-key KL0 is close as new left side
Key word and using the second sub-key KR0 as new right side key word, enters step 1.If so, the phase of S104 can be entered
Close operation.
As a kind of feasible embodiment, the sub-key can be stored to corresponding after generating the sub-key
In register.
S104: successively first left side coded word and first right side coded word are held using the N group sub-key
Row XOR operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.
Wherein, successively the first left side coded word and first right side coded word are executed using sub-key in this step different
Or operation and mould 2MOperation is added to be equivalent to execution iterative operation.The encrypted result that previous generation is obtained is as next-generation encryption
Input data, detailed process may comprise steps of:
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set Y=1；Wherein,
The numerical digit for generating time more early sub-key is smaller；
Wherein, number minimum value herein is 1, maximum value N, and difference is 1 between adjacent number.
Step 2: using 2 sub-keys numbered as Y as current first sub-key and current second sub-key；
Wherein, there are two for the sub-key that the present embodiment default number is Y, further, current first in the present embodiment
Sub-key is the corresponding sub-key of left side key word, and current second sub-key is the corresponding sub-key of right side key word.
Step 3: first left side coded word and current first sub-key being subjected to XOR operation and obtain the first operation knot
Fruit, and first operation result and first right side coded word are executed into mould 216Add operation obtains the second operation result, will
Second operation result ring shift right C obtains the first intermediate cryptographic as a result, the first right side after ring shift left D is encoded
Word and the first intermediate cryptographic result execute XOR operation and operate to obtain the second intermediate cryptographic result；
Step 4: the first intermediate cryptographic result and the second intermediate cryptographic result are subjected to mould 216Add operation obtains
The third operation result and the current first sub-key execution XOR operation are obtained current first and added by third operation result
It is close to be obtained currently as a result, the first right side coded word after ring shift left A is executed xor operation with current first encrypted result
Second encrypted result；
Step 5: judging whether Y is greater than N；If so, will be according to current first encrypted result and current second encrypted result
It is encoded as to the ciphertext after the confidential information encryption to be added；If it is not, then using current first encrypted result as new the
One left side coded word, and Y plus one is entered step 2 using current second encrypted result as the first new right side coded word；
Relative to N group that in such a way that S box is encrypted, the present embodiment is obtained by cipher key spreading in the related technology
Key successively executes cryptographic operation to the first left side coded word and first right side coded word and obtains ciphertext coding.Further
, since the present embodiment is by executing XOR operation and mould 2MOperation is added to realize information encryption, the process is without complicated operation
Logic improves hardware utilization in ciphering process, reduces the requirement to carrier computing capability and memory space.Therefore, originally
Embodiment can reduce encryption information process occupied memory space under the premise of meeting certain safety.
Fig. 2 is referred to below, and Fig. 2 is a kind of flow chart of information decryption method provided by the embodiment of the present application.As
For the further supplement of Fig. 1 corresponding embodiment ciphering process, the present embodiment treat scrambled execute cryptographic operation after,
Can also include following corresponding decryption oprerations:
S201: when receiving the corresponding decryption instructions of ciphertext coding, according to the decryption instructions with half-word for singly
Position is divided into the second left side coded word and the second right side coded word；
S202: successively second left side coded word and second right side coded word are held using the N group sub-key
Row XOR operation and mould 2MAdd operation, obtains the plaintext coding to encode execution decryption processing to the ciphertext.
Operation in specific S202 may comprise steps of:
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set X=N；Wherein,
The numerical digit for generating time more early sub-key is smaller, and the numerical digit for generating time identical sub-key is identical；
Step 2: numbering the sub-key for X as current first sub-key and current second sub-key for described；
Wherein, there are two for the sub-key that the present embodiment default number is X, further, current first in the present embodiment
Sub-key is the corresponding sub-key of left side key word, and current second sub-key is the corresponding sub-key of right side key word.
Step 3: second left side coded word and second right side coded word being executed into XOR operation and obtain the 4th fortune
It calculates as a result, the 4th operation result, which is moved to right A, obtains the second intermediate decrypted result；By second left side coded word and institute
It states current second sub-key progress XOR operation and obtains the 5th operation result, among the 5th operation result and described second
Key word R1 carries out mould 216Add operation obtains the first intermediate decrypted result；
Step 4: the described first intermediate decrypted result and the second intermediate decrypted result being subjected to XOR operation and obtain the
Six operation results obtain current second decrypted result for described 6th operation result ring shift right D；After ring shift left C
The first intermediate decrypted result and current second decrypted result carry out mould 216Add operation obtains the 7th operation result, by the described 7th
Operation result and current first sub-key execute XOR operation and operate to obtain current first decrypted result；
Step 5: judging whether X is equal to 1；If so, will be according to current first decrypted result and current second decrypted result
It is encoded as the plaintext obtained after decryption processing is encoded to the ciphertext；If it is not, then using current first decrypted result as new
Second left side coded word, and using current second decrypted result as the second new right side coded word, X is subtracted one, enters step 2.
Illustrate above-mentioned implementation below by a kind of lightweight method for encryption/decryption for Internet of Things in practical applications
The process of example description.Fig. 3, Fig. 4, Fig. 5 and Fig. 6 are referred to, Fig. 3 is the present embodiment integrated circuit structural schematic diagram, and Fig. 4 is this reality
The operation inner frame schematic diagram of a cipher key spreading circuit each round is applied, Fig. 5 is that the present embodiment encryption and decryption circuit general frame shows
It is intended to, Fig. 6 is the inner frame schematic diagram of the operation of each round in the present embodiment enciphering and deciphering algorithm.
(1) encryption flow
It is divided into 2 coded words L and R as unit of half-word Step 1: encoding one group in plain text, master key coding is with half-word
Unit is divided into 2 key words L and R；
Step 2: by master key encode in L key word ring shift left 5, then with master key coding in L key word R carry out
Mould 216Add, generates new L1.By master key encode in R key word ring shift right 4, then with master key coding in newly-generated key
Word L1 carries out XOR operation, generates new R1.Again by L1 key word ring shift left 5, mould 2 is carried out with R1 afterwards16Add, generates new
kL0.By R1 key word ring shift right 4, then with key word kL0XOR operation is carried out, new k is generatedR0.Store the respective loops.
Step 3: two 10 sub-keys of regeneration of the step of repeating cipher key spreading process；
Step 4: by the respective loops k of plaintext coded word L and generationL0Carry out XOR operation, then with plaintext coded word R into
Row mould 216Add, the recycling of result after adding moves to right 3 generation L', by plaintext coded word R ring shift left 2, then with coded word L'
It carries out XOR operation and generates R'.
Step 5: L' and coded word R' is carried out mould 216Add, the respective loops k of result and generation after addingR0Carry out exclusive or
Operation generates L1, by coded word R' ring shift left 5, then carries out XOR operation with coded word L1 and generates R1；
It is successively repeated in order using the 2nd respective loops to the 10th respective loops Step 6: being encoded in plain text to described one group
Step 4, five carry out 10 wheel encryptions；
Step 7: for coding after 10 wheel encryptions, output obtains ciphertext coding in plain text when one group；
(2) process is decrypted
Step 1: one group of ciphertext coding is divided into 2 coded words L and R as unit of half-word, master key coding is with half-word
Unit is divided into 2 key words L and R；
Step 2: by master key encode in L key word ring shift left 5, then with master key coding in L key word R carry out
Mould 216Add, generates new L1.By master key encode in R key word ring shift right 4, then with master key coding in newly-generated key
Word L1 carries out XOR operation, generates new R1.Again by L1 key word ring shift left 5, mould 2 is carried out with R1 afterwards16Add, generates new
kL0.By R1 key word ring shift right 4, then with key word kL0XOR operation is carried out, new k is generatedR0.Store the respective loops.
Step 3: two 10 sub-keys of regeneration of the step of repeating decrypting process；
Step 4: ciphertext coded word R and ciphertext coded word L is carried out XOR operation, recycling moves to right 5 generation R'.It will
Ciphertext coded word L and respective loops kR9XOR operation is carried out, then carries out mould 2 with R116Add operation, generates L'；
Step 5: ciphertext coded word R' and ciphertext coded word L' is carried out XOR operation, recycling moves to right 2 generation R1.
Mould 2 is carried out by ciphertext coded word L' ring shift left 3, then with R116Add operation, then with respective loops kL9It is raw to carry out XOR operation
At L1；
It successively repeats to walk using the 9th respective loops to the 0th respective loops in order Step 6: encoding described one group in plain text
Rapid four, five carry out 10 wheel decryption；
Step 7: after 10 wheel decryption, output obtains to be encoded coding in plain text in plain text when one group.
10 sub-keys can be deposited by Register File mode in above-described embodiment.
The specific interface of RegisterFile is as follows:
The width of RegisterFile is 32 bits, and depth 10, mem_data_rd_raw [31:0] is decrypting process
Respective loops are read from RegisterFile, clk is clock signal of system, and CEN is the enable signal of RegisterFile,
The signal definition is effective when being decryption, and WR is read-write, which is that high level is read effectively, and low level is with effect.
Mem_addr [8:4] is address signal, and label need to be read from which address of RegisterFile or write-in data, each when
Clock period, address value add 1, stop until for 10, i.e. decryption is completed.Mem_data_wr [31:0] is to write to RegisterFile
The sub-key of the data port of respective loops namely every wheel, such as: in decrypting process it may first have to the son of generated 10 wheel
The sub-key of key, 10 wheels is generated by key schedule, one respective loops of each clock cycle generation, and to
RegisterFile write-in.Rk0 is generated when the first round, this hour wheel number is 1, namely sub-key rk0 within this clock cycle
The place that address is 0 in RegisterFile is write into, second clock cycle writes into sub-key rk1 on the ground that address is 1
Side ..., the 10th clock cycle write into sub-key rk9 in the place that address is 9 in RegisterFile, have generated whole 10
Before respective loops, the key_ready signal of control circuit is dragged down, i.e. mem_rw_b signal is dragged down by height, RegisterFile
Be in the write state, and after 10 respective loops are all generated and whole writes into RegisterFile after, control circuit
Key_ready signal be 1, RegisterFile is in read states at this time, and the value of mem_addr [8:4] is defined as at this time
(10-round), first clock cycle namely mem_addr [8:4] are 0 when decryption, are read from RegisterFile at this time
Address is the value of (9-0)=9 out, i.e. reading sub-key rk9, mem_data_rd [31:0] is rk9, when second when decryption
Clock period namely mem_addr [8:4] are 1, read the value that address is (9-1)=8 from RegisterFile at this time, that is, read
Sub-key rk8 out, mem_data_rd [31:0] be rk8 ..., decryption when the 9th clock cycle namely mem_addr [8:
4] it is 9, reads the value that address is (9-9)=0, i.e. reading sub-key rk0, mem_data_rd from RegisterFile at this time
[31:0] is rk0 for decrypting, to complete decrypting process.
The present embodiment above content is explained as follows.
The function of each signal is described as follows in attached drawing 3:
Input signal:
Clk: system clock input；
Rst_: reset signal, low level are effective；
En_de: encryption and decryption mode, 0 is decryption, and 1 is encryption；
Key [31:0]: the master key of algorithm, bit wide are 32 bits；
Key_valid: key input indicative signal；
New_key: more new master key indication signal；
Data_in [31:0]: inputting in plain text, and bit wide is 32 bits；
Data_valid: plaintext input indicative signal；
Start: start encryption and decryption signal.
Output signal:
Crypt_out [31:0]: ciphertext output, bit wide are 32 bits；
Done: encryption and decryption termination instruction signal.
Encryption key lengths be 32 bits, be expressed as K=L | R, wherein L and R be half-word, round key be expressed as (rk0,
Rk1 ..., rk9), wherein rki (i=0,1 ..., 9) is word.Round key is generated by encryption key.This algorithm is changed using non-linear
For structure, cryptographic calculation is carried out as unit of half-word, an iteration operation is referred to as that a round transformation mono- shares 10 wheel iterated transforms.
Inventive algorithm hardware implementation method includes the hardware realization and enciphering and deciphering algorithm of the key schedule in algorithm
Hardware realization, and with quick hardware algorithm implementation method realize after circuit include cipher key spreading circuit, encryption and decryption circuit.
The cipher key spreading circuit refers to the circuit that sub-key needed for 10 wheel encryption and decryption in algorithm is generated with the master key of 32 bits,
In each respective loops length be 32 bits.The encryption and decryption circuit refers to 32 bits in plain text and is generated by cipher key spreading circuit
10 respective loops obtain the circuit of 32 bit ciphertexts by the encryption process that algorithm 10 is taken turns.The wheel control circuit refers to selection
With the wheel number in control key expanded circuit and encryption and decryption circuit.
The encryption and decryption circuit defines the register of 10 32 bits, is deposited as caused by enciphering and deciphering algorithm respectively
The wheel ciphertext of 10 wheels, wherein the wheel ciphertext of each round is 10 bits, and it is 32 bits that data, which input length, and is inputted by a data
Indication signal data_valid determines when to be sent into 32 new bit datas, and indication signal data_valid is that a cycle is
32 new bit datas are sent into after the indication signal of 10 clock units namely every 10 clock units.
The encryption and decryption circuit, when indication signal data_valid indication signal is effective, first group of 32 bit data
It is sent into encryption and decryption circuit, can get the ciphertext of first group of 32 bit data by 10 clock units, then through 10 clock lists
Member can be obtained the ciphertext of second group of 32 bit data, then can be obtained the close of 32 bit data of third group through 10 clock units
Text, and so on, until all data processings are completed.
Related content in above-mentioned technical proposal is explained as follows:
In above scheme, the plaintext coding is divided into 2 coded words L and R:M=L as unit of half-word | R, | for connection
Symbol.10 sub-keys are deposited by Register File mode in the decrypting process.Nonlinear transformation in the ciphering process
Are as follows: τ is nonlinear transformation in ciphering process, and wherein modulus N is 216, i.e., It is meant that mould N adds,
That is the result mould N of A+B.Nonlinear transformation τ: input is set as A=(a15, a14, a13 ... a0) ∈ (216), B=(b15, b14,
b13…b0)∈(216), it exports as C=(c15, c14, c13 ... c0) ∈ (216), then have: Linear transformation L: the output of nonlinear transformation τ is also
The input of linear transformation L.If input is C ∈ 216, then have:
D=L (C)=C < < < 3, wherein < < < i is that 16 bit cyclics move to left i.
In above scheme, nonlinear transformation in the decrypting process are as follows: τ is nonlinear transformation in ciphering process, wherein mould
Number N is 216, i.e. τ=(A-B) modN.
Nonlinear transformation τ: input is set as A=(a15, a14, a13 ... a0) ∈ (216), B=(b15, b14, b13 ... b0) ∈
(216), it exports as C=(c15, c14, c13 ... c0) ∈ (216), then have:
(c15, c14, c13 ... c0)=τ (A, B)=(A-B) modN；
Linear transformation L': nonlinear transformation τ output is also the input of linear transformation L'.If input is C ∈ 216, then
Have:
D=L (C)=C > > > 2, wherein > > > i is that 16 bit cyclics or so move i.
Since above-mentioned technical proposal is used, the present invention has following advantages and effect compared with prior art:
(1) present invention design is succinct and area occupied is few, eliminates the bigger S of area, and integral operation is simple, not multiple
Miscellaneous arithmetic logic, cipher key spreading mode are similar with encryption and decryption mode.The utilization rate of hardware is higher when the algorithm is realized, and advantageous
It is realized on smaller circuit area in entire algorithm.
(2) highly-safe, there is relatively reliable guarantee for the information security in China.
(3) circuit is realized simple, by defining different registers for depositing wheel ciphertext and son caused by each round
Key does not need the logic of excessive consideration enciphering and deciphering algorithm and key schedule so that circuit realization is relatively easy
It realizes.
(4) applicable surface is wider, by using simple logical operation and smaller area, it is made to reach certain safety
Property after, computing capability to carrier and memory space require to substantially reduce, so that can be suitably used for computing capability and storage
The weaker application field of size requirements can be applicable in different application environments so that its use scope expands.
Fig. 7 is referred to, Fig. 7 is a kind of structural schematic diagram of information encryption system provided by the embodiment of the present application；
The system may include:
Information determination module 100, for when receiving encrypted instruction, determining confidential information and master key coding to be added；Its
In, the confidential information to be added is to encode in plain text；
Division module 200, for master key coding to be divided into left side key word and right side key as unit of half-word
Word, and the confidential information to be added is divided into the first left side coded word and the first right side coded word as unit of half-word；
Cipher key expansion module 300 is operated for executing cipher key spreading according to the left side key word and right side key word
To N group sub-key；
Encrypting module 400, for successively using the N group sub-key to first left side coded word and first right side
Side coded word executes XOR operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext volume to the confidential information to be added
Code.
Relative to N group that in such a way that S box is encrypted, the present embodiment is obtained by cipher key spreading in the related technology
Key successively executes cryptographic operation to the first left side coded word and first right side coded word and obtains ciphertext coding.Further
, since the present embodiment is by executing XOR operation and mould 2MOperation is added to realize information encryption, the process is without complicated operation
Logic improves hardware utilization in ciphering process, reduces the requirement to carrier computing capability and memory space.Therefore, originally
Embodiment can reduce encryption information process occupied memory space under the premise of meeting certain safety.
Further, the cipher key expansion module 300 includes:
Intermediate key determination unit, for carrying out the left side key word after ring shift left A with the right side key word
Mould 216Add operation obtains the first intermediate key word L1, by after ring shift right B right side key word and first intermediate key
Word L1 executes XOR operation and operates to obtain the second intermediate key word R2；
Sub-key determination unit, for the first intermediate key word L1 after ring shift left A and second centre is close
Key word L2 executes mould 216Add operation obtains the first sub-key KL0, by the right side key word and first son after ring shift right B
Key KL0 executes XOR operation and operates to obtain the second sub-key KR0；
Sub-key processing unit, for setting one group of son for the first sub-key KL0 and the second sub-key KR0
Key, and record the group number of sub-key；
Judging unit, for judging whether described group of number is greater than N；If it is not, then using the first sub-key KL0 as new
Left side key word and using the second sub-key KR0 as new right side key word, starts the intermediate key determination unit pair
The workflow answered.
Since the embodiment of components of system as directed is corresponded to each other with the embodiment of method part, the embodiment of components of system as directed is asked
Referring to the description of the embodiment of method part, wouldn't repeat here.
Present invention also provides a kind of computer readable storage mediums, have computer program thereon, the computer program
It is performed and step provided by above-described embodiment may be implemented.The storage medium may include: USB flash disk, mobile hard disk, read-only deposit
Reservoir (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or
The various media that can store program code such as CD.
Present invention also provides a kind of electronic equipment, may include memory and processor, have meter in the memory
Calculation machine program may be implemented provided by above-described embodiment when the processor calls the computer program in the memory
Step.Certain electronic equipment can also include various network interfaces, the components such as power supply.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For system disclosed in embodiment
Speech, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is referring to method part illustration
?.It should be pointed out that for those skilled in the art, under the premise of not departing from the application principle, also
Can to the application, some improvement and modification can also be carried out, these improvement and modification also fall into the protection scope of the claim of this application
It is interior.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.Under the situation not limited more, the element limited by sentence "including a ..." is not arranged
Except there is also other identical elements in the process, method, article or apparatus that includes the element.
Claims (10)
1. a kind of information ciphering method characterized by comprising
When receiving encrypted instruction, confidential information and master key coding to be added is determined；Wherein, the confidential information to be added is to compile in plain text
Code；
Master key coding is divided into left side key word and right side key word as unit of half-word, and by the confidential information to be added
It is divided into the first left side coded word and the first right side coded word as unit of half-word；
Cipher key spreading is executed according to the left side key word and the right side key word to operate to obtain N group sub-key；
XOR operation successively is executed to first left side coded word and first right side coded word using the N group sub-key
With mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.
2. information ciphering method according to claim 1, which is characterized in that described close according to the left side key word and right side
Key word execution cipher key spreading operates to obtain N number of sub-key
Step 1: by the left side key word and right side key word progress mould 2 after ring shift left A16Add operation obtains in first
Between key word L1, by after ring shift right B right side key word and the first intermediate key word L1 execute XOR operation operation
Obtain the second intermediate key word R2；
Step 2: by the first intermediate key word L1 and the second intermediate key word L2 execution mould 2 after ring shift left A16Add behaviour
The first sub-key KL0 is obtained, by the right side key word and the first sub-key KL0 execution exclusive or fortune after ring shift right B
It calculates operation and obtains the second sub-key KR0；
Step 3: setting one group of sub-key for the first sub-key KL0 and the second sub-key KR0, and record sub-key
Group number；
Step 4: judging whether described group of number is greater than N；If it is not, then using the first sub-key KL0 as new left side key word
And using the second sub-key KR0 as new right side key word, 1 is entered step.
3. information ciphering method according to claim 2, which is characterized in that successively using the N group sub-key to described the
One left side coded word and first right side coded word execute XOR operation and mould 2MAdd operation, so as to the confidential information to be added
It performs encryption processing to obtain ciphertext and encode and includes:
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set Y=1；Wherein, described
The numerical digit for generating time more early sub-key is smaller, and the numerical digit for generating time identical sub-key is identical；
Step 2: using 2 sub-keys numbered as Y as current first sub-key and current second sub-key；
Step 3: first left side coded word and current first sub-key are subjected to XOR operation and obtain the first operation result, and
First operation result and first right side coded word are executed into mould 216Add operation obtains the second operation result, by described
Two operation result ring shift rights C obtain the first intermediate cryptographic as a result, by after ring shift left D the first right side coded word and institute
The first intermediate cryptographic result execution XOR operation is stated to operate to obtain the second intermediate cryptographic result；
Step 4: the first intermediate cryptographic result and the second intermediate cryptographic result are subjected to mould 216Add operation obtains third
The third operation result and current first sub-key are executed XOR operation and obtain current first encryption knot by operation result
The first right side coded word after ring shift left A is executed xor operation with current first encrypted result and obtains current second by fruit
Encrypted result；
Step 5: judging whether Y is greater than N；If so, will be according to current first encrypted result and current second encrypted result conduct
To the ciphertext coding after the confidential information encryption to be added；If it is not, then left using current first encrypted result as new first
Side coded word, and Y plus one is entered step 2 using current second encrypted result as the first new right side coded word.
4. information ciphering method according to claim 1, which is characterized in that further include:
After generating the sub-key, the sub-key is stored into corresponding register.
5. information ciphering method according to claim 2, which is characterized in that further include:
When receiving the corresponding decryption instructions of ciphertext coding, it is divided into second as unit of half-word according to the decryption instructions
Left side coded word and the second right side coded word；
XOR operation successively is executed to second left side coded word and second right side coded word using the N group sub-key
With mould 2MAdd operation, obtains the plaintext coding to encode execution decryption processing to the ciphertext.
6. encryption method according to claim 5, which is characterized in that successively left to described second using the N group sub-key
Side coded word and second right side coded word execute XOR operation and mould 2MAdd operation, to execute solution to ciphertext coding
Close processing obtains the plaintext coding
Step 1: all sub-keys being from morning to night sequentially numbered according to the time is generated, and set X=N；Wherein, described
The numerical digit for generating time more early sub-key is smaller, and the numerical digit for generating time identical sub-key is identical；
Step 2: numbering the sub-key for X as current first sub-key and current second sub-key for described；
Step 3: second left side coded word and second right side coded word being executed into XOR operation and obtain the 4th operation knot
4th operation result is moved to right A and obtains the second intermediate decrypted result by fruit；Second left side coded word is worked as with described
Preceding second sub-key carries out XOR operation and obtains the 5th operation result, by the 5th operation result and second intermediate key
Word R1 carries out mould 216Add operation obtains the first intermediate decrypted result；
Step 4: the described first intermediate decrypted result and the second intermediate decrypted result being subjected to XOR operation and obtain the 6th fortune
It calculates as a result, obtaining current second decrypted result for described 6th operation result ring shift right D；By after ring shift left C
One intermediate decrypted result and current second decrypted result carry out mould 216Add operation obtains the 7th operation result, by the 7th operation
As a result XOR operation is executed with current first sub-key to operate to obtain current first decrypted result；
Step 5: judging whether X is equal to 1；If so, will be according to current first decrypted result and current second decrypted result conduct
The plaintext coding obtained after decryption processing is encoded to the ciphertext；If it is not, then using current first decrypted result as new second
Left side coded word, and using current second decrypted result as the second new right side coded word, X is subtracted one, enters step 2.
7. a kind of information encryption system characterized by comprising
Information determination module, for when receiving encrypted instruction, determining confidential information and master key coding to be added；Wherein, described
Confidential information to be added is to encode in plain text；
Division module, for master key coding to be divided into left side key word and right side key word as unit of half-word, and will
The confidential information to be added is divided into the first left side coded word and the first right side coded word as unit of half-word；
Cipher key expansion module operates to obtain N for executing cipher key spreading according to the left side key word and the right side key word
Group sub-key；
Encrypting module, for successively being encoded using the N group sub-key to first left side coded word and first right side
Word executes XOR operation and mould 2MAdd operation, to perform encryption processing to obtain ciphertext coding to the confidential information to be added.
8. information encryption system according to claim 7, which is characterized in that the cipher key expansion module includes:
Intermediate key determination unit, for the left side key word after ring shift left A to be carried out mould 2 with the right side key word16
Add operation obtains the first intermediate key word L1, by the right side key word and the first intermediate key word L1 after ring shift right B
XOR operation is executed to operate to obtain the second intermediate key word R2；
Sub-key determination unit, for by after ring shift left A the first intermediate key word L1 and the second intermediate key word
L2 executes mould 216Add operation obtains the first sub-key KL0, by the right side key word and first sub-key after ring shift right B
KL0 executes XOR operation and operates to obtain the second sub-key KR0；
Sub-key processing unit, it is close for setting one group of son for the first sub-key KL0 and the second sub-key KR0
Key, and record the group number of sub-key；
Judging unit, for judging whether described group of number is greater than N；If it is not, then using the first sub-key KL0 as new left side
Key word and using the second sub-key KR0 as new right side key word, it is corresponding to start the intermediate key determination unit
Workflow.
9. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program realizes the step of the information ciphering method as described in any one of claim 1 to 6 when the computer program is executed by processor
Suddenly.
10. a kind of electronic equipment characterized by comprising
Memory, for storing computer program；
Processor, realizing the information ciphering method as described in any one of claim 1 to 6 when for executing the computer program
Step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910349533.3A CN110071927B (en) | 2019-04-28 | 2019-04-28 | Information encryption method, system and related components |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910349533.3A CN110071927B (en) | 2019-04-28 | 2019-04-28 | Information encryption method, system and related components |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110071927A true CN110071927A (en) | 2019-07-30 |
| CN110071927B CN110071927B (en) | 2021-09-14 |
Family
ID=67369256
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910349533.3A Active CN110071927B (en) | 2019-04-28 | 2019-04-28 | Information encryption method, system and related components |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110071927B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113901492A (en) * | 2021-09-06 | 2022-01-07 | 苏州国芯科技股份有限公司 | Data transmission encryption and decryption method, device, system and equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101196965A (en) * | 2006-12-07 | 2008-06-11 | 上海安创信息科技有限公司 | Algorithm of encrypted chip with anti-attack advanced encryption standard |
| CN101459510A (en) * | 2007-12-14 | 2009-06-17 | 华为技术有限公司 | Implementation method and device for real-time transmission data encryption algorithm |
| CN101764685A (en) * | 2009-10-26 | 2010-06-30 | 广州杰赛科技股份有限公司 | Encrypting and deciphering system for realizing SMS4 algorithm |
| CN101895389A (en) * | 2010-07-16 | 2010-11-24 | 黑龙江大学 | Methods for encrypting and decrypting combined coding based file by adopting proportion calculation |
| CN101924630A (en) * | 2010-09-06 | 2010-12-22 | 苏州国芯科技有限公司 | Rapid encoding and decoding method for wireless local area network |
| CN103236923A (en) * | 2010-09-06 | 2013-08-07 | 苏州国芯科技有限公司 | Efficient and safe encryption method for WLAN (Wireless Local Area Network) |
| CN104301095A (en) * | 2014-10-13 | 2015-01-21 | 深圳中科讯联科技有限公司 | DES round operation method and circuit |
| US20150195089A1 (en) * | 2014-01-07 | 2015-07-09 | Fijitsu Limited | Data scramble device, security device, security system, and data scramble method |
| CN106027227A (en) * | 2016-07-01 | 2016-10-12 | 浙江工业大学 | Fermat number number-theoretic transform and SAFER (Secure And Fast Encryption Routine) cipher algorithm combined block encryption method |
-
2019
- 2019-04-28 CN CN201910349533.3A patent/CN110071927B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101196965A (en) * | 2006-12-07 | 2008-06-11 | 上海安创信息科技有限公司 | Algorithm of encrypted chip with anti-attack advanced encryption standard |
| CN101459510A (en) * | 2007-12-14 | 2009-06-17 | 华为技术有限公司 | Implementation method and device for real-time transmission data encryption algorithm |
| CN101764685A (en) * | 2009-10-26 | 2010-06-30 | 广州杰赛科技股份有限公司 | Encrypting and deciphering system for realizing SMS4 algorithm |
| CN101895389A (en) * | 2010-07-16 | 2010-11-24 | 黑龙江大学 | Methods for encrypting and decrypting combined coding based file by adopting proportion calculation |
| CN101924630A (en) * | 2010-09-06 | 2010-12-22 | 苏州国芯科技有限公司 | Rapid encoding and decoding method for wireless local area network |
| CN103236923A (en) * | 2010-09-06 | 2013-08-07 | 苏州国芯科技有限公司 | Efficient and safe encryption method for WLAN (Wireless Local Area Network) |
| US20150195089A1 (en) * | 2014-01-07 | 2015-07-09 | Fijitsu Limited | Data scramble device, security device, security system, and data scramble method |
| CN104301095A (en) * | 2014-10-13 | 2015-01-21 | 深圳中科讯联科技有限公司 | DES round operation method and circuit |
| CN106027227A (en) * | 2016-07-01 | 2016-10-12 | 浙江工业大学 | Fermat number number-theoretic transform and SAFER (Secure And Fast Encryption Routine) cipher algorithm combined block encryption method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113901492A (en) * | 2021-09-06 | 2022-01-07 | 苏州国芯科技股份有限公司 | Data transmission encryption and decryption method, device, system and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110071927B (en) | 2021-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1993922B (en) | Stream cipher combining system and method | |
| CN101073220B (en) | Method and apparatus for increasing the speed of cryptographic processing | |
| CN105324956B (en) | The method and apparatus of encrypting plaintext data | |
| CN101350714B (en) | Efficient advanced encryption standard (AES) data path using hybrid RIJNDAEL S-BOX | |
| CA2864227C (en) | Lightweight stream cipher cryptosystems | |
| CN104639314A (en) | Device based on AES (advanced encryption standard) encryption/decryption algorithm and pipelining control method | |
| CN102224704A (en) | Content decoding apparatus, content decoding method and integrated circuit | |
| CN102012993A (en) | Methods and devices for selectively encrypting and decrypting data | |
| CN105959098A (en) | Format-reserved encryption algorithm based on multi-segmented Feistel network | |
| CN107579813A (en) | information encryption and decryption method and device | |
| CN112398639B (en) | Device and method for realizing Fountain lightweight encryption algorithm and application | |
| CN109274485A (en) | A kind of data ciphering method, data authentication method and relevant device and system | |
| CN108052805B (en) | Data encryption and decryption method and device | |
| US11258579B2 (en) | Method and circuit for implementing a substitution table | |
| CN110071794A (en) | A kind of information ciphering method based on aes algorithm, system and associated component | |
| CN103095449A (en) | Dynamic encryption and decryption method based on stream ciphers | |
| CN103051446A (en) | Key encryption and storage method | |
| CN103731822A (en) | System and method for achieving ZUC | |
| CN104484126A (en) | Safe data deleting method and system based on erasure codes | |
| KR101506499B1 (en) | Method for encrypting with SEED applying mask | |
| CN110071927A (en) | A kind of information ciphering method, system and associated component | |
| CN104219045A (en) | RC4 (Rivest cipher 4) stream cipher generator | |
| CN106656500A (en) | Encryption device and method | |
| CN115760126B (en) | Financial transaction information encryption method | |
| CN101924630B (en) | Rapid encoding and decoding method for wireless local area network |
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 |