5 results about "Inverse operation" patented technology

The application provides a digital signature verification method and device, electronic equipment and a storage medium, which comprises the following steps: calculating a point on an elliptic curve based on Jacobian projection coordinate system change to avoid one division operation, and further avoiding inverse operation by transformation under the premise of only adding one judgment step by using the characteristics of finite field operation. By optimizing the inverse algorithm on different prime fields, the modulus inverse operation required for the final coordinate system conversion in the digital signature verification calculation process is converted into modulus multiplication operation under the same condition by adding one judgment, and considering that the overhead of inverse operation is often much larger than that of modulus multiplication operation, the verification speed is greatly improved after the improvement.

The invention discloses a security detection method and device for a cryptographic algorithm, and the method comprises the steps: setting target plaintext data, and carrying out the processing of a target plaintext through a predefined cryptographic algorithm, and obtaining a target ciphertext; performing inverse operation of CBC chain operation on the target ciphertext to obtain an intermediate ciphertext; comparing the target plaintext data with the intermediate ciphertext, and cracking to obtain an S box; constructing an inverse S box according to the S box; solving according to the intermediate ciphertext and the inverse S box to obtain a decryption result; and comparing the decryption result with the target plaintext data to obtain a comparison result. The device comprises a memory and a processor used for executing the security detection method of the cryptographic algorithm. The invention provides a new direction aiming at the security performance detection of the encryption method. The method can be widely applied to the field of security detection.

The present application relates to the technical field of information security, and more particularly to a lightweight encryption and decryption method, comprising: obtaining sensor continuity binary data stream and dividing it into fixed length packets; calling pre-generated round key sequence and whitening key, wherein the round key sequence is generated by main key shift operation and round constant iteration; performing XOR operation on the packet data and the whitening key to output initial confusion data; dividing the initial confusion data into four equal length subsegments to perform multi-round iteration processing, each round including 16-bit modulo addition operation and fixed bit cyclic shift; performing XOR operation on the shifted data and the current round key, updating the subsegment state according to a preset branch processing rule, and performing linear transformation on the updated state using a self-inverse matrix; splicing the subsegments output in the last round into ciphertext and transmitting to an execution mechanism; and calling the round key sequence in reverse direction during decryption, performing inverse transformation and inverse operation using the self-inverse matrix to restore the original data. The present application solves the problem of high encryption delay of industrial control equipment.

The invention provides a parameterized Reed-Solomon code unified decoding method and device and a medium, and relates to the technical field of forward error correction. In order to solve the problems of complex hardware implementation and high resource consumption of the existing configurable decoder, the method configures decoding steps according to a first code pattern parameter representing the number of check symbols and a second code pattern parameter representing the truncation characteristic. The decoding step comprises the following steps: calculating a syndrome; solving the key equation by adopting a recombined non-inverse algorithm to obtain an error position polynomial and an error value polynomial; and error positioning, error value calculation and error correction are carried out. By adopting the non-inverse algorithm, complex Galois field inversion operation is avoided, hardware implementation is remarkably simplified, resource consumption is reduced, and efficient and flexible unified decoding is achieved.

The invention relates to the field of electrical digital data processing, in particular to an elliptic curve batch scalar multiplication acceleration method based on optimized Jacobian coordinate transformation, which comprises the following steps: generating a scalar set K to be processed and an elliptic curve point set P; performing batch scalar multiplication on K and P by using a Jacobian coordinate system; z coordinates of all points in the calculation result set are extracted, a Z coordinate set is constructed, and a multiplication tree is constructed according to the Z coordinate set; performing modular inverse operation on the root node value of the multiplication tree to obtain a modular inverse element of the root node, and constructing an inverse element tree from top to bottom based on the modular inverse element of the root node; performing batch conversion on the Jacobian coordinates based on leaf node values in the inverse element tree, and converting a calculation result set from the Jacobian coordinates to affine coordinates; according to the method, n times of modular inverse operation is optimized into one time of modular inverse operation and 3n-3 times of modular multiplication operation, so that the overall elliptic curve batch scalar multiplication efficiency is remarkably improved, and the calculation overhead of an elliptic curve cryptographic scheme is reduced.