CN116707877A - Data encryption method and system based on improved AES algorithm - Google Patents

Data encryption method and system based on improved AES algorithm Download PDF

Info

Publication number
CN116707877A
CN116707877A CN202310606969.2A CN202310606969A CN116707877A CN 116707877 A CN116707877 A CN 116707877A CN 202310606969 A CN202310606969 A CN 202310606969A CN 116707877 A CN116707877 A CN 116707877A
Authority
CN
China
Prior art keywords
state
bits
processing
plaintext
matrixes
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.)
Pending
Application number
CN202310606969.2A
Other languages
Chinese (zh)
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.)
Electric Power Research Institute of Guangxi Power Grid Co Ltd
Original Assignee
Electric Power Research Institute of Guangxi Power Grid 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 Electric Power Research Institute of Guangxi Power Grid Co Ltd filed Critical Electric Power Research Institute of Guangxi Power Grid Co Ltd
Priority to CN202310606969.2A priority Critical patent/CN116707877A/en
Publication of CN116707877A publication Critical patent/CN116707877A/en
Pending legal-status Critical Current

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
    • H04L63/0435—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 wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption
    • 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/088—Usage controlling of secret information, e.g. techniques for restricting cryptographic keys to pre-authorized uses, different access levels, validity of crypto-period, different key- or password length, or different strong and weak cryptographic algorithms
    • 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/14—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using a plurality of keys or algorithms
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

The application provides a data encryption method and a system based on an improved AES algorithm, wherein the method comprises the following steps: step 1: and obtaining a plaintext to be encrypted. Step 2: a key length is determined, the key length comprising 128 bits, 192 bits, and 256 bits. Step 3: and carrying out grouping processing on the plaintext, and dividing the plaintext into a plurality of state matrixes. Step 4: carrying out round processing on all the state matrixes to obtain a corresponding number of encryption state matrixes; and the number of the state matrixes is the same as that of the encryption state matrixes, and the final ciphertext is generated through the last round of processing. Step 5: and back-propagating the final ciphertext by using an inverse function to obtain a decryption result of the final ciphertext. The key length of the application can be transformed according to the plaintext and the actual requirement, and meanwhile, the application also utilizes the inversion function and the round transformation, thereby better ensuring the safety and confidentiality of the electric power data.

Description

Data encryption method and system based on improved AES algorithm
Technical Field
The application belongs to the field of data confidentiality, and particularly relates to a data encryption method and system based on an improved AES algorithm.
Background
Along with the continuous development of the energy industry and technology in China, the related data of the power system also has an exponential explosion growth. For security, some of the power data needs to be kept secret, and thus, the data encryption technology plays an irreplaceable role in information security of the power system. The data encryption method commonly used at present is an AES algorithm, which is a commonly used symmetric encryption algorithm.
The key lengths used by the conventional AES algorithm are 128 bits, 192 bits and 256 bits. The conventional AES algorithm cannot change the key length, and in the case of using a 128-bit key, the AES algorithm can only encrypt 16 bytes of data, and requires multiple operations for encrypting larger data, which affects the efficiency of the algorithm.
Disclosure of Invention
In order to solve or improve the problems, the application provides a data encryption method and system based on an improved AES algorithm, and the specific technical scheme is as follows:
the application provides a data encryption method based on an improved AES algorithm, which comprises the following steps:
step 1: obtaining a plaintext to be encrypted, and step 2: a key length is determined, the key length comprising 128 bits, 192 bits, and 256 bits. Step 3: and carrying out grouping processing on the plaintext, and dividing the plaintext into a plurality of state matrixes. Step 4: carrying out round processing on all the state matrixes to obtain a corresponding number of encryption state matrixes; and the number of the state matrixes is the same as that of the encryption state matrixes, and the final ciphertext is generated through the last round of processing. Step 5: and back-propagating the final ciphertext by using an inverse function to obtain a decryption result of the final ciphertext.
Preferably, the state matrix in step 3 includes:
each state matrix group is 128 bits in length, and each state matrix includes 16 bytes.
Preferably, all the state matrices in the step 4 are subjected to round processing, including:
when the key length is 128 bits, carrying out 10 rounds of processing on all the state matrixes; when the key length is 192 bits, carrying out 12 rounds of processing on all the state matrixes; when the key length is 256 bits, 14 rounds of processing are performed on all the state matrices.
Preferably, the wheel processing in step 4 includes: byte substitution, row shifting, and column aliasing.
Preferably, the wheel processing in step 4 further includes: the last round of processing is performed, which includes byte substitution and row shifting.
Preferably, the byte substitution includes:
and replacing each byte in the state matrix with the corresponding byte in the S-Box.
Preferably, the row shift includes:
the first row in the state matrix remains unchanged, the second row is shifted to the left by 1 byte position, the third row is shifted to the left by 2 byte positions, the fourth row is shifted to the left by 3 byte positions, and for each column, each byte in the column is shifted cyclically in a specific order.
Preferably, the column confusion includes:
taking a column in the state matrix as a column vector of 4x 1; from each of the state matrices, 4x1 column vectors can be determined;
multiplying the 4x1 column vectors with a 4x4 matrix respectively, to obtain 4 new 4x1 column vectors respectively.
Based on the same inventive concept, the application also provides a data encryption system based on the improved AES algorithm, which is characterized by comprising the following steps:
plaintext acquisition unit: for obtaining the plaintext to be encrypted. A key determination unit: for determining a key length from plaintext, the key length comprising 128 bits, 192 bits, and 256 bits. Plain text grouping unit: the method is used for carrying out grouping processing on the plaintext and is divided into a plurality of state matrixes. Wheel processing unit: the method comprises the steps of performing round processing on all state matrixes to obtain a corresponding number of encryption state matrixes; and the number of the state matrixes is the same as that of the encryption state matrixes, and the final ciphertext is generated through the last round of processing. Back propagation unit: and the method is used for carrying out back propagation on the final ciphertext by utilizing an inverse function to obtain a decryption result of the final ciphertext.
The beneficial effects of the application are as follows: the application adopts the design of variable key length, can flexibly select different key lengths, and improves the efficiency of the algorithm. In addition, the inversion function and the wheel transformation are introduced, so that the encryption security of the data information of the power system can be improved.
Drawings
Fig. 1 is a flowchart of a data encryption method based on the modified AES algorithm according to an embodiment of the present application.
Fig. 2 is a schematic block diagram of a data encryption system based on the modified AES algorithm according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
It should be understood that the terms "comprises" and "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
The application provides a data encryption method based on an improved AES algorithm as shown in fig. 1, which comprises the following steps:
step 1: and obtaining a plaintext to be encrypted.
Specifically, the plaintext to be encrypted comprises personal information of the power consumer, account passwords, energy data, power equipment operation data and power equipment production data.
Step 2: a key length is determined, the key length comprising 128 bits, 192 bits, and 256 bits.
Specifically, when selecting the key length, three aspects of security, algorithm efficiency, and system limitations need to be considered.
Safety: longer key lengths can generally provide greater security because short keys are vulnerable to hacking, dictionary attacks, and the like. And selecting a proper key length according to the security requirement of the application scene and the importance degree of data security.
Algorithm efficiency: too long a key length may reduce the efficiency of the algorithm, resulting in slower encryption and decryption speeds. Therefore, while considering security, there is also a need to trade off algorithm efficiency.
System limitations: some systems have weaker processing power and less memory space and cannot support longer key lengths. At this time, a key with a moderate length needs to be selected to ensure the safety and efficiency of the system.
Step 3: and carrying out grouping processing on the plaintext, and dividing the plaintext into a plurality of state matrixes. Specifically, each state matrix group is 128 bits in length, and each state matrix includes 16 bytes.
Step 4: carrying out round processing on all the state matrixes to obtain a corresponding number of encrypted state matrixes; and the number of the state matrixes is the same as that of the encryption state matrixes, and the final ciphertext is generated through the last round of processing.
Specific:
the wheel process includes: byte substitution, row shifting, and column aliasing. When the key length is 128 bits, carrying out 10 rounds of processing on all the state matrixes; when the key length is 192 bits, carrying out 12 rounds of processing on all the state matrixes; when the key length is 256 bits, 14 rounds of processing are performed on all the state matrices. The last round of processing is performed, which includes byte substitution and row shifting.
And byte substitution, namely, each byte in the state matrix is replaced with a corresponding byte in an S-Box (subtitling Box cipher substitution Box), so that each byte in each block can be encrypted into a different value by byte substitution, the encryption complexity and strength are increased, the data are safer, common attack means such as violent attack, differential attack and linear attack are effectively resisted, and the data security is ensured. The S-Box is a 256 byte look-up table, each of which is pre-defined. Table 1 shows the S-Box used in the present application. Each element in the table is an 8-bit number (0-255) represented as two 16-ary characters.
Table 1 cipher substitution box
63 7c 77 7b f2 6b 6f c5 30 01 67 2b fe d7 ab 76
ca 82 c9 7d fa 59 47 f0 ad d4 a2 af 9c a4 72 c0
b7 fd 93 26 36 3f f7 cc 34 a5 e5 f1 71 d8 31 15
04 c7 23 c3 18 96 05 9a 07 12 80 e2 eb 27 b2 75
09 83 2c 1a 1b 6e 5a a0 52 3b d6 b3 29 e3 2f 84
53 d1 00 ed 20 fc b1 5b 6a cb be 39 4a 4c 58 cf
d0 ef aa fb 43 4d 33 85 45 f9 02 7f 50 3c 9f a8
51 a3 40 8f 92 9d 38 f5 bc b6 da 21 10 ff f3 d2
cd 0c 13 ec 5f 97 44 17 C4 A7 7E 3D 64 5D 19 73
60 81 4F DC 22 2A 90 88 46 EE B8 14 DE 5E 0B DB
E0 32 3A 0A 49 06 24 5C C2 D3 AC 62 91 95 E4 79
E7 C8 37 6D 8D D5 4E A9 6C 56 F4 EA 65 7A AE 08
BA 78 25 2E 1C A6 B4 C6 E8 DD 74 1F 4B BD 8B 8A
70 3E B5 66 48 03 F6 0E 61 35 57 B9 86 C1 1D 9E
E1 F8 98 11 69 D9 8E 94 9B 1E 87 E9 CE 55 28 DF
8C A1 89 0D BF E6 42 68 41 99 2D 0F B0 54 BB 16
The row shift, i.e. the first row in the state matrix remains unchanged, the second row is shifted to the left by 1 byte position, the third row is shifted to the left by 2 byte positions, the fourth row is shifted to the left by 3 byte positions, and for each column, each byte in the column is cyclically shifted in a specific order. The line shift operation can prevent not only linear and differential attacks, but also other security threats such as replay attacks, and after a plurality of rounds of round function calculation, the position of each byte in the state matrix also changes by the corresponding round number, thereby increasing the encryption strength and the unpredictability of data.
Column confusion, i.e. taking a column in the state matrix as a 4x1 column vector; from each of the state matrices, 4x1 column vectors can be determined, and the 4x1 column vectors are multiplied by a 4x4 matrix respectively to obtain 4 new 4x1 column vectors respectively.
Step 5: and back-propagating the final ciphertext by using an inverse function to obtain a decryption result of the final ciphertext.
Specifically, back propagation includes reverse S-box transformation, reverse shift, reverse column obfuscation, and round-by-round use of reverse encryption keys.
The inverse S-box transform is a reverse substitution of each byte in the encryption result. The inverse S-Box transform may be performed using an inverse S-Box table transformed with the forward S-Box transform. The value Byte' i, j of the reverse S-Box table is opposite to the value Byte i.j of the S-Box, the rule of reverse S-Box transformation is shown in the following expression,
Byte'[i,j]＝S^(-1)(Byte[i.j])；
where Byte' [ i, j ] represents the Byte of the ith row and jth column in the reverse order S-Box table, and Byte [ i.j ] represents the Byte of the ith row and jth column in the S-Box table.
And (3) reverse shift, namely keeping the first row unchanged in the state matrix, moving the second row to the right by 1 byte position, moving the third row to the right by 2 byte positions, and moving the fourth row to the right by 3 byte positions.
The rule of reverse column confusion is shown in the following expression:
[AES]^(-1)(x)＝c 0 ^(-1)x 0 +c 3 ^(-1)x 3 +c 2 ^(-1)xi 2 +c 1 ^(-1)x 1 ；
wherein c 0 、c 1 、c 2 C 3 For inverse transforming the weight coefficients in the matrix, x 0 、x 1 、x 2 X 3 Four bytes in the input column.
The round-by-round use sequence of the reverse encryption key needs to be in one-to-one correspondence with the encryption process, and round-by-round calculation is performed strictly according to the sub-keys of the same sequence.
Based on the same inventive concept, the application also provides a data encryption system based on the improved AES algorithm, as shown in fig. 2, comprising:
plaintext acquisition unit: for obtaining the plaintext to be encrypted.
A key determination unit: for determining a key length from plaintext, the key length comprising 128 bits, 192 bits, and 256 bits.
Plain text grouping unit: the method is used for carrying out grouping processing on the plaintext and is divided into a plurality of state matrixes.
Wheel processing unit: the method comprises the steps of performing round processing on all state matrixes to obtain a corresponding number of encryption state matrixes; and the number of the state matrixes is the same as that of the encryption state matrixes, and the final ciphertext is generated through the last round of processing.
Back propagation unit: and the method is used for carrying out back propagation on the final ciphertext by utilizing an inverse function to obtain a decryption result of the final ciphertext.
In summary, the application adopts the design of variable key length, can flexibly select different key lengths, and improves the efficiency of the algorithm. In addition, the inversion function and the wheel transformation are introduced, so that the confidentiality and the safety of data information of the power system can be improved.
Those of ordinary skill in the art will appreciate that the elements of the examples described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the elements of the examples have been described generally in terms of functionality in the foregoing description to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. 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 application.
In the embodiments provided in the present application, it should be understood that the division of the units is merely a logic function division, and there may be other division manners in actual implementation, for example, multiple units may be combined into one unit, one unit may be split into multiple units, or some features may be omitted.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the application, and are intended to be included within the scope of the appended claims and description.

Claims (9)

1. A data encryption method based on an improved AES algorithm, comprising:
step 1: acquiring a plaintext to be encrypted;
step 2: determining a key length, the key length comprising 128 bits, 192 bits, and 256 bits;
step 3: grouping the plaintext into a plurality of state matrixes;
step 4: carrying out round processing on all the state matrixes to obtain a corresponding number of encryption state matrixes; the number of the state matrixes is the same as that of the encryption state matrixes, and a final ciphertext is generated through the last round of processing;
step 5: and back-propagating the final ciphertext by using an inverse function to obtain a decryption result of the final ciphertext.
2. The data encryption method and system based on the modified AES algorithm as claimed in claim 1, wherein the state matrix in the step 3 includes:
each state matrix group is 128 bits in length, and each state matrix includes 16 bytes.
3. The method and system for encrypting data based on modified AES algorithm as claimed in claim 1, wherein all the state matrices in step 4 are round-processed, comprising:
when the key length is 128 bits, carrying out 10 rounds of processing on all the state matrixes;
when the key length is 192 bits, carrying out 12 rounds of processing on all the state matrixes;
when the key length is 256 bits, 14 rounds of processing are performed on all the state matrices.
4. A method and system for encrypting data based on modified AES algorithm as claimed in claim 3, wherein the round processing in step 4 comprises:
byte substitution, row shifting, and column aliasing.
5. The method and system for encrypting data based on modified AES algorithm as claimed in claim 4, wherein the round processing in step 4 further comprises:
the last round of processing is performed, which includes byte substitution and row shifting.
6. The method and system for encrypting data based on modified AES algorithm as claimed in claim 4, wherein the byte substitution comprises:
and replacing each byte in the state matrix with the corresponding byte in the S-Box.
7. The method and system for encrypting data based on modified AES algorithm as claimed in claim 4, wherein the shifting of the rows comprises:
the first row in the state matrix remains unchanged, the second row is shifted to the left by 1 byte position, the third row is shifted to the left by 2 byte positions, the fourth row is shifted to the left by 3 byte positions, and for each column, each byte in the column is shifted cyclically in a specific order.
8. The method and system for encrypting data based on modified AES algorithm as claimed in claim 4, wherein the column confusion comprises:
taking a column in the state matrix as a column vector of 4x 1; from each of the state matrices, 4x1 column vectors can be determined;
multiplying the 4x1 column vectors with a 4x4 matrix respectively, to obtain 4 new 4x1 column vectors respectively.
9. A data encryption system based on the modified AES algorithm, comprising:
plaintext acquisition unit: the method comprises the steps of obtaining a plaintext to be encrypted;
a key determination unit: for determining a key length from plaintext, the key length comprising 128 bits, 192 bits, and 256 bits;
plain text grouping unit: the method comprises the steps of performing grouping processing on plaintext, and dividing the plaintext into a plurality of state matrixes;
wheel processing unit: the method comprises the steps of performing round processing on all state matrixes to obtain a corresponding number of encryption state matrixes; the number of the state matrixes is the same as that of the encryption state matrixes, and a final ciphertext is generated through the last round of processing;
back propagation unit: and the method is used for carrying out back propagation on the final ciphertext by utilizing an inverse function to obtain a decryption result of the final ciphertext.
CN202310606969.2A 2023-05-26 2023-05-26 Data encryption method and system based on improved AES algorithm Pending CN116707877A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310606969.2A CN116707877A (en) 2023-05-26 2023-05-26 Data encryption method and system based on improved AES algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310606969.2A CN116707877A (en) 2023-05-26 2023-05-26 Data encryption method and system based on improved AES algorithm

Publications (1)

Publication Number Publication Date
CN116707877A true CN116707877A (en) 2023-09-05

Family

ID=87828473

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310606969.2A Pending CN116707877A (en) 2023-05-26 2023-05-26 Data encryption method and system based on improved AES algorithm

Country Status (1)

Country Link
CN (1) CN116707877A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117394987A (en) * 2023-11-08 2024-01-12 广东知业科技有限公司 Method and system for secure communication between edge computing and cloud service

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117394987A (en) * 2023-11-08 2024-01-12 广东知业科技有限公司 Method and system for secure communication between edge computing and cloud service

Similar Documents

Publication Publication Date Title
Liu et al. Color pathological image encryption algorithm using arithmetic over Galois field and coupled hyper chaotic system
Liu et al. Analysis of the SMS4 block cipher
CA2449669C (en) Block encryption device using auxiliary conversion
JP2004502965A (en) Replacement box for symmetric key cryptography
CN107257279B (en) Plaintext data encryption method and device
CN111431697B (en) Novel method for realizing lightweight block cipher CORL
Mohan et al. Performance analysis of AES and MARS encryption algorithms
Gnatyuk et al. High-Performance Reliable Block Encryption Algorithms Secured against Linear and Differential Cryptanalytic Attacks.
CN116707877A (en) Data encryption method and system based on improved AES algorithm
Amorado et al. Enhanced data encryption standard (DES) algorithm based on filtering and striding techniques
CN117411618B (en) Key generation method, device and encryption method applied to international event
CN111614457B (en) P replacement improvement-based lightweight packet encryption and decryption method, device and storage medium
Stoianov One approach of using key-dependent S-BOXes in AES
Santhanalakshmi et al. Enhanced AES-256 cipher round algorithm for IoT applications
EP3998738A1 (en) Secured performance of a cryptographic process
Alsobky et al. Design and Implementation of Advanced Encryption Standard by New Substitution Box in Galois Field (𝟐𝟖)
JP3782210B2 (en) Crypto device
Yadav et al. MILES: Modeling Large S-box in MILP Based Differential Characteristic Search.
Chmiel et al. Involutional block cipher for limited resources
Wenceslao Jr et al. Modified AES algorithm using multiple S-boxes
Surameery Modified advanced encryption standard for boost image encryption
Mahrousa et al. A novel method to increase diffusion and confusion in AES algorithm
Ajlouni et al. A New Approach in Key Generation and Expansion in Rijndael Algorithm.
CN113766499A (en) Underwater movable equipment wireless encryption communication method based on improved SM4 algorithm
Siahaan et al. Data Security using 128-bit Advanced Encryption Standard Algorithm

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