136 results about "Block cipher" patented technology

The invention relates to the technical field of industrial wireless networks, in particular to an industrial wireless network security communication method based on a national cryptographic algorithm, which comprises the following steps that: identity authentication is required before equipment accesses the network, and gateway equipment and field equipment finish bidirectional identity authentication through the national cryptographic algorithm SM2. The secure communication method provided by the invention comprises three stages of identity authentication, key negotiation and data encryption and decryption, identity authentication is carried out by adopting a national cryptographic algorithm SM2, and transmitted data is encrypted and data integrity is verified by adopting a hash-based message authentication code SM3 (HMAC-SM3) and an SM4 block cipher algorithm (SM4). According to the secure communication method, how to save the storage space and the communication overhead of a WIA-FA network is considered, and meanwhile, a set of secure transmission protocol which is autonomously controllable on the industrial wireless network standard and the cryptographic algorithm is realized, so that the security, the reliability and the controllability in the industrial communication process are fundamentally guaranteed.

According to the instant application, there are provided systems and methods to create a quantum secure / resistant secure communication channel (QSR-SCC) for communication between two or more end-points at or within devices, applications, services, APIs, secure communication protocols, etc. In one example of a QSR-SCC, a quantum secure / resistant private network (QSR-PN) extends existing VPN solutions using one time pad (OTP) based keys, augmented handshake mechanisms, and interchangeable ciphers, for example, stream ciphers or block ciphers, for enhancing security associated with the QSR-PN.

The invention provides a flight data processing method and device for an unmanned aerial vehicle and electronic equipment, and relates to the technical field of communication, and the method comprises the steps: collecting the original flight data of the unmanned aerial vehicle through a sensor disposed on the unmanned aerial vehicle, and carrying out the calculation, denoising and smoothing of the original flight data, and obtaining the real-time flight data of the unmanned aerial vehicle; generating a flight data packet according with a specified format based on the real-time flight data, a specified unmanned aerial vehicle ID corresponding to the unmanned aerial vehicle and specified flight plan data; encrypting the flight data packet by using an SM4 block cipher algorithm to obtain flight ciphertext data; in response to detecting that the signal receiving power of the current network of the data recording equipment is greater than the specified power, transmitting the flight ciphertext data to a supervision server by using the current network; and in response to detection that the signal receiving power of the current network is lower than or equal to the specified power, switching a communication channel for transmitting the flight ciphertext data to a satellite short message communication channel.

The invention discloses a lightweight block cipher binary linear matrix automatic design method and system. Meanwhile, the implementation cost and the safety property of constructing the binary linear matrix are considered, and from the perspective of circuit implementation, an automatic tool is used for constructing the binary linear matrix. From the perspective of circuit realization, the realization cost of two dimensions of area and time delay can be considered, and the cryptography cost is constrained while the security property of the binary linear matrix is considered. In addition, a g-XOR method is used for designing the matrix, and compared with a traditional method for iteratively designing according to the structure or constructing a binary linear matrix through mathematical derivation, the implementation cost is the lowest, all solutions for constructing the binary linear matrix can be included, and the method can be used for judging the cost limit.

The invention discloses an impossible difference-intermediate encounter attack password analysis method, which comprises the following steps of: obtaining an impossible difference partition device of a certain block cipher, respectively expanding forwards and backwards for several rounds according to the difference characteristics of the head and the tail of the impossible difference partition device, and recording corresponding parameters; selecting a plaintext to attack, encrypting to obtain a corresponding ciphertext, and calculating data complexity required by the attack according to corresponding parameters; a key involved in the forward extension part is guessed, partial encryption is performed on the plaintext, pairing is performed by using data after partial encryption, and ciphertext data pairs corresponding to data pairs satisfying forward differential propagation are stored in a hash table; a key related to the backward expansion part is guessed, partial decryption is carried out on the ciphertext, pairing is carried out by using the partially decrypted data, online matching is carried out on a ciphertext pair corresponding to a data pair satisfying backward differential propagation and a ciphertext data pair in a hash table, and a wrong key is eliminated; and carrying out exhaustion search on the remaining candidate keys to find a correct key.

The invention belongs to the field of passwords, and discloses an anti-quantum message authentication code construction method and system adopting an adjustable block cipher. The MAC generation method comprises the steps that two communication parties share a key value K generated by a key generation algorithm, the label length tau = Tag is agreed, the tau is limited to be smaller than or equal to n, and n represents the packet length; and taking the key K, the message M and the unique value N as input to generate a tau-bit message authentication code Tag. Furthermore, the MAC verification method verifies the generated message authentication code, and judges whether the message is correct or not and whether the message is accepted or not. According to the method, the adjustment handle value is an encryption result of a unique value initially, and then the adjustment handle is updated by using a function h when the adjustable block cipher is called every time. The method has the quantum attack resisting capability, and compared with the existing known MAC scheme with the quantum attack resisting capability, the required storage is small under the condition of providing the same quantum security intensity.

The invention relates to a time-sensitive network end-to-end secure communication method, and belongs to the technical field of communication. According to the method, a TSN terminal system of Linux is used for realizing bidirectional identity authentication and key agreement based on an SM2 cryptographic algorithm, and an SM4-CCM algorithm is used for realizing time-sensitive network security communication and data integrity verification; the SM2 national secret algorithm is an asymmetric encryption algorithm, a signature pair is generated based on an elliptic curve discrete logarithm problem, the two parties negotiate a shared key through elliptic curve point operation, a public key of a receiver is used for encryption, and only a private key can be used for decryption; sM4-CCM is a combination of an SM4 block cipher algorithm and a CCM mode, and is used for providing confidentiality, integrity and authenticity of data; according to the CCM mode, through combination of CTR encryption and CBC-MAC authentication, efficient authentication encryption is realized. The method can be used for real-time secure communication in a high-reliability industrial scene.

The invention discloses a block cipher algorithm identification method based on multi-modal feature fusion. The method comprises the following steps: firstly, converting ciphertext data into three modal representations of a text, an image and voice; then integrating a deep learning model suitable for each mode through a multi-mode feature fusion strategy, and performing feature extraction on ciphertext data of different modes; on this basis, based on a transform model and by adopting a medium-term fusion strategy, performing weighted fusion on the features of different modals, and training the model; and finally, based on the trained model, realizing identification of an encryption algorithm adopted by an unknown ciphertext. According to the method, feature extraction is completed through different encoders, a feature fusion thought is adopted, and a transform model containing a self-attention mechanism is introduced to perform multi-modal feature fusion, so that the robustness and generalization ability of the model are effectively improved, and the recognition accuracy of the model is improved.

The invention discloses an authentication encryption method, verification decryption method, system and device based on block cipher, and the authentication encryption method comprises the steps: determining a block cipher and a secret key which are used by a bottom layer, selecting an initial vector which is not used in encryption under the current secret key, taking the triad of the initial vector, the associated data and the plaintext as the input of an authentication encryption algorithm; the encryption part encrypts the masked plaintext by using a codebook mode to obtain a ciphertext; the authentication part processes the masked associated data by using a PMAC mode to obtain an authentication intermediate value, performs exclusive or on plaintext groups and encrypts the plaintext groups by using a block cipher, and performs exclusive or on the authentication intermediate value and a result encrypted by using the block cipher to generate an authentication label; and sending the initial vector, the associated data, the ciphertext and the authentication tag as a ciphertext message to a receiving end or storing the ciphertext message for decryption. According to the method, the confidentiality and integrity of data can be protected under quantum computing, and the computing efficiency can be improved through parallel computing.

To suppress an increase in computation time in a semiconductor device while further improving resistance to side-channel attacks.SOLUTION: A semiconductor device (1) according to one embodiment of the present invention includes: a dividing unit (10) for dividing data into at least two pieces of divided data; a block cipher execution unit (10) for applying a specific process included in a block cipher algorithm only to at least one of the pieces of divided data among the at least two pieces of divided data; and a data holding unit (11) for holding, in each block, the pieces of divided data to which the process has been applied only to a part thereof, the data holding unit (11) being configured such that side-channel information radiated differs at least partially among the blocks.SELECTED DRAWING: Figure 3

A processing module for a communication device includes memory for storing a key and processing elements. These elements receive a current sequence number and a random number from a network entity, and check if the current sequence number is within a range based on a previously received sequence number stored in memory. If not, they generate a sequence number encryption key from the random number and stored key, encrypt the previously received sequence number using a block cipher encryption function, and send the encrypted sequence number in a response message to the network entity.

The present disclosure relates to an authenticated encryption method, apparatus, system, and computer program for providing enhanced security and extension of a nonce length, and more specifically, the present disclosure discloses a method for performing authenticated encryption using a computing apparatus, the method including: producing a plurality of intermediate values, based on a given input value; generating a random number, based on a combination of a plurality of intermediate random values produced by performing block cipher-based encoding on the plurality of intermediate values; and performing encryption or decryption, based on the random number.

The invention provides a block cipher key security analysis method based on a neural discriminator. The method comprises the following steps: generating a plaintext pair according to a given input differential feature; the method comprises the following steps of: respectively carrying out specified round encryption operation on a plaintext pair by utilizing a grouped key to obtain a primary ciphertext pair, respectively carrying out full round encryption on the plaintext pair by utilizing a random grouped key to obtain a complete ciphertext pair, and calculating an intermediate state difference of the primary ciphertext pair; marking the complete ciphertext pair according to an intermediate difference screening mechanism to construct a training sample; training a deep learning neural network model by using the training sample; and inputting a to-be-analyzed ciphertext pair into the trained deep learning neural network model, and outputting a classification result whether a preset difference feature condition is met or not. The method shows excellent adaptive capacity to unknown encryption rounds and key variants, and the password security analysis effect is improved.

Method for encrypting a plaintext with a block cipher E of block size L E using a symmetric key K, characterized in that a fingerprint function (FP u ) is used, which satisfies the two requirements that from two unequal bit sequences (BF1 ≠ BF2) with a sufficiently high probability for the application, it follows that the results of the application of the fingerprint function (FP u ) on these bit sequences are unequal (FP u (BF1) ≠ FP u (BF2)), and that to the fingerprint function (FP u ) a fingerprint reversal function (FP u -1 ) exists, so that the following always applies: FP u -1 (FP u (BF) || BF[u+1..L(BF)]) = BF[1..u], where u and L Edo not necessarily have to be equal, and a general cipher EGen is used by applying the fingerprint function to the concatenation of the complete first u bits PB u 1 of the plaintext and selected or all bits FPlnput of the remaining plaintext, and then the first block of the ciphertext CB 1 by EGen encryption of the u-bit long result FP u (PB u 1 || FPInput), i.e. CB 1 := EGen(FP u (PB u 1 || FPlnput)), and the resulting encryption of the first u bits of the plaintext CB 1 as initialization vector IV := CB 1 for the encryption of parts of the or of the remaining plaintext with the block cipher E, using any operating mode requiring an initialization vector (IV).

The invention relates to a large-adjustment adjustable block cipher working mode design method, and belongs to the field of information security. According to the method, the data block is encrypted in a manner of respectively adjusting the input, output and key of the block cipher by using the adjusting handle and the internal variable obtained by the adjusting handle encryption. The adjustable block cipher provided by the invention only depends on the block cipher and does not use a hash function in design, so that the loss of handle adjusting information is avoided, the adjustable block cipher can be realized by using a standard grouping algorithm, the security is consistent with that of the used grouping algorithm, and the adjustable block cipher can be conveniently used in various scenes. According to the adjustable block cipher adjusting handle, the length of the accommodated adjusting handle is greatly increased and reaches five times of the block length, and the requirement for the length of the adjustable block cipher adjusting handle in the current known scene is basically met.

Data blocks of an input data unit may be received in parallel as a data segment on a data bus. For each received data segment, tweak values corresponding to the data blocks may be generated using a key and an input vector. The data blocks may be encrypted using parallel encryption circuitry blocks, based on a symmetric block cipher that uses another key and one of the tweak values. The encrypted data blocks may be combined into an output data unit.

Disclosed is a block cipher with a self-reversible overall structure. The self-reversible structure is constructed from three inventive points: 1. The main structure starts with an odd-numbered round and alternates between even-numbered and odd-numbered rounds. 2. The odd-numbered round consists of three components in series, decomposing in the encryption direction as: entry operator → S-odd component → exit operator, where the two operators are designed to be inverses of each other, and the inputs of the entry and exit operators are connected to the wheel key. Even-numbered rounds are equal to S-even; both S-odd and S-even are self-reversible logic design components. 3. It is recommended that S-even ≠ S-odd. The main effect of this invention is that the encryption and decryption logic are completely consistent, and the mode transition is equivalent to the reversed wheel key, enabling the construction of a fast-spreading SP-type block cipher. Also disclosed are X-component design, EWES, and other embodiments, operating mode applications, instruction set design methods, IP core products, CPU products, devices, and programs.

The invention discloses an anti-quantum block cipher coprocessor operation method for a computer monitoring system, and the method comprises the following steps: S1, loading data to generate a random number and a secret key, and splicing the random number and the secret key with a preset initialization vector to generate an input state; s2, receiving the associated parameters and the plaintext, and performing preprocessing to generate grouping mask shares; s3, performing parallel encryption on the grouped mask shares based on an input state to generate a plurality of mask ciphertexts and mask authentication tags; and S4, performing linear reconstruction on the mask ciphertext to finally run to obtain a complete ciphertext, decomposing plaintext data into a plurality of mask shares for parallel processing, effectively diluting data structure features, and fundamentally cutting off a way of acquiring key information by an attacker through power consumption analysis. Compared with the prior art, the parallel computing advantage of reconfigurable hardware is fully utilized, efficient execution of cryptographic operation is achieved, the whole data processing process is completed in the register, and the influence of memory access delay on system performance is remarkably reduced.

The invention discloses an authentication encryption method and system with bidirectional linearity. The method comprises the following steps of: (1) jointly selecting an n-bit block cipher E, a secret key K and a block length m by participants; (2) executing an encryption scheme by a sender: calculating an initial state S0 = EK (N) according to a temporary value N; dividing the plaintext M into m bits of blocks M1,..., M1; connecting the Mi with the bit representation of the ordinal number in sequence, inputting a state chain value Si-1 and the Mi [i] n-m into a linear mixing function rho to obtain Si and Ci, and outputting a ciphertext Ci; for the last two blocks Ml-1 and M1, calculating C * for the Ml-1 by using the same method, dividing the C * into Cl-1 and Z, and outputting the Cl-1; and connecting and filling the M1 and the Z, calculating # imgabs0 # and a plaintext length M, calculating # imgabs1 #, and outputting the # imgabs1 #. And (3) the receiver executes the decryption scheme, checks the correctness of the ciphertext and outputs a correctly decrypted plaintext. The method has the implementation advantage of low storage space, the required storage space is close to the block length (32-512 bits) of the block cipher, and the method is suitable for application scenes with limited resources.

The application discloses a kind of light security communication method and system for agricultural perception node.The method includes that 256-bit static master key is preset in the bottom layer security storage area of perception node and heterogeneous convergence gateway, and the unique hardware serial number is read as node identification;Synchronous acquisition environmental data and visual feature data, splice into long payload plaintext;Derive dynamic session key, use dynamic session key to drive stream cipher to encrypt long payload plaintext, static master key drives block cipher to encrypt short header, and encapsulates into data frame;Data frame is sent through wireless channel, and heterogeneous convergence gateway receives and reversely decrypts short header to extract dynamic anti-fake factor, and replay attack verification is carried out;After verification, dynamic session key is reconstructed to restore data and uploaded to cloud data management server.The application also discloses a system using the above light security communication method for agricultural perception node, realizes the high security node legitimacy authentication and anti-replay attack under limited hardware computing power.

Methods for updating 256-bit cryptographic keys using a cryptographic key update system include the transmission of a first transmission, a second transmission, and a third transmission. The second transmission is a symmetric key encryption using a cipher key consisting of a concatenation of a plurality of parameters and a new cryptographic key.The sender derives the encryption key by transforming an authentication key and a bit sequence of constant values ​​based on a one-way compression function, which is one of the following: a Modification Detection Code 2 (MDC-2) cryptographic hash function with an advanced 128-bit encryption standard (AES-128) as the underlying block cipher, a Modification Detection Code 4 (MDC-4) cryptographic hash function with the advanced 128-bit encryption standard (AES-128) as the underlying block cipher, the Hirose compression function with the advanced 256-bit encryption standard (AES-256) as the underlying block cipher, and a 256-bit hash function.

Various examples are provided related to a block cipher adaptation of the Galois Extension Fields (GEF) combination technique. In one example, a GEF-based block encryption includes forming an output from a PRNG into a key matrix, where the key matrix is formatted as an invertible square matrix; applying a GEF operation to the key matrix to map elements to a closed subset in a higher-order GEF space; mapping plaintext to a plaintext matrix; applying a GEF operation to the plaintext matrix to map elements to the higher-order GEF space; combining the plaintext matrix and the key matrix to produce a vector of ciphertext in the higher-order GEF space; reducing the vector to a reduced vector of ciphertext using an inverse of the GEF operation; and during the reducing, applying a ceiling operation to bijectively map elements in the reduced vector to a closed subset. Another example includes GEF-based block decryption.

To provide an efficient and secure solution for managing encryption of a software image updated on a secure element.SOLUTION: The present invention relates to methods, apparatuses and systems for implementing an encryption scheme for providing a software image to a secure element. The software image is converted into a sequence of ciphered blocks, which is protected with an authentication tag to obtain a sequence of protected blocks, which are then transmitted to an update agent on the secure element. The steps of converting the software image into a sequence of ciphered blocks and protecting the sequence of ciphered blocks with an authentication tag are implemented by an authenticated encryption function using a same block cipher.SELECTED DRAWING: Figure 3

The invention discloses a parallel message authentication code construction method and system for quantum security. The method comprises the following steps: 1) selecting an adjustable block cipher algorithm key K, nonlinear transformation theta and the length tau of a message identification code by a participant; 2) the sender executes an MAC generation scheme, takes the key K, the temporary value N and the message M as input, outputs a message identification code and sends the message identification code to the receiver; the flow of the MAC generation scheme is as follows: a) dividing a message M into a plurality of n-bit groups; b) encrypting the ith group Mi by using an algorithm, and inputting theta to obtain a state Si after the output and the state Si-1 are subjected to XOR; c) intercepting the leftmost side tau bit of the state Sm corresponding to the last group as a message identification code; and 3) the receiver executes an MAC verification scheme, and verifies whether (MAC, M) is correct or not by taking the key K, the temporary value N, the message M and the message authentication code MAC as input.

The invention discloses a block cipher algorithm identification method based on multi-scale pooling characteristics. The method comprises the following steps: normalizing a ciphertext data set after encrypting a public data set, and carrying out multi-scale segmentation; constructing calculation methods of a repetition degree feature, a compression ratio feature, a frequency deviation, a run observation value and a structural strength feature, calculating a feature vector of each segmented ciphertext, and carrying out pooling calculation to obtain a feature data set of the ciphertext; inputting the feature data set into the constructed gradient boosting decision-making tree for training to obtain an optimal decision-making tree; and for unknown ciphertext data, the trained optimal gradient boosting decision tree is used as a classifier to complete the identification of the cryptographic algorithm. The method is based on multiple scales, adopts multiple feature calculation methods to quantify subtle differences of different ciphertext data, and performs feature fusion through pooling calculation, so that the feature extraction capability of the ciphertext data is improved, and the cryptographic algorithm recognition accuracy of the model is improved.

A block cipher method and apparatus using round repetition for providing, from a plaintext message (10), a ciphertext message (50) and a global tag (52) is disclosed. The plaintext message is converted into a plurality of ordered plaintext blocks (11) which are successively processed during a round for computing:—a cryptogram (30) by encrypting input data (20) using a single cryptographic key, said cryptogram comprising a first segment (31) and a second segment (32)—a ciphertext block (51) by performing a first operation (41) using, as operands: said first segment (31) said current plaintext block (11) and said second segment (32). At each next round said input data is newly determined based on the current ciphertext block and an updated reproducible data. The ciphertext message is determined by concatenating the ciphertext blocks and the global tag by a second operation (42) using computed authentication local tags as operands.

The present invention discloses a method and system compatible with two block cipher algorithms, AES and SM4. The method compatible with two block cipher algorithms, AES and SM4, comprises: converting the operation process of a single general iterative round in the unified round operation of SM4 and the unified round operation of AES from the first round to the eighth round into a global pipeline operation process of a front linear transformation, an S-box substitution transformation and a back linear transformation; the front linear transformation comprises at least one level of timing isolation segment, and any level of the timing isolation segment is composed of at least one XOR gate or is a linear transformation timing isolation segment for realizing permutation processing. The present invention can achieve a balance between high performance and low resource consumption compatible with two block cipher algorithms, AES and SM4.

The invention relates to a block cipher side channel analysis method based on experience accumulation and three-dimensional decision, and belongs to the technical field of cipher security analysis and side channel analysis. Aiming at the problems of large search space, low information utilization rate, computing power waste and the like in the traditional correlation coefficient energy analysis, the method provides an analysis framework combining a dynamic hierarchical screening mechanism and a cross validation strategy. The method comprises the following steps: randomly initializing each byte of a key to generate a candidate set; constructing a three-dimensional decision-making structure comprising a data layer, a statistical layer and a decision-making layer so as to record and analyze correlation coefficient distribution; screening conditions are automatically tightened through dynamic threshold attenuation, and the search range is gradually reduced; and adopting a multi-stage single-byte perturbation and cross validation strategy to carry out iterative optimization and ranking on each byte candidate value, and finally selecting an optimal key combination to carry out verification. According to the method, the success rate, robustness and convergence speed of side channel analysis are effectively improved, and the method is suitable for key recovery of block cipher.

The application discloses a GPU-based ARX type block cipher optimal differential characteristic search method, which first selects a high-probability differential transition to split the whole search process into forward search and reverse search; differential transition construction and probability calculation are taken as kernel functions, a GPU-based parallel scheme is designed, and the differential transition probability of different states in each round is calculated in parallel; the GPU parallel calculation result and the set probability threshold are taken as the determination condition of pruning in the search process, the optimal differential characteristic is searched round by round according to the branch and bound strategy, the forward and reverse searches are completed, and the optimal differential characteristics of the two parts are obtained; finally, the optimal differential characteristics of the two parts are spliced to obtain the optimal differential characteristics of the complete rounds. The search method can effectively reduce the recursion depth, improve the search efficiency through parallel calculation, shorten the calculation time and improve the search speed of the ARX type block cipher optimal differential characteristic.

A method for updating a 256-bit cryptographic key by a cryptographic key update system includes transmitting a first transmission, a second transmission, and a third transmission. The second transmission is symmetric key encryption under a serial key encryption key and a new cryptographic key of a plurality of parameters. The transmitter derives a key encryption key by converting an authentication key and a constant bit string based on a one-way compression function, the one-way compression function is one of the following functions: taking a 128-bit advanced encryption standard (AES-128) as a password hash function of a modified detection code 2 (MDC-2) of a bottom block password, taking the 128-bit advanced encryption standard (AES-128) as a password hash function of a modified detection code 4 (MDC-4) of the bottom block password, and taking a 256-bit advanced encryption standard (AES-256) as a Hirose compression function of the bottom block password; and a 256-bit hash function.