Bypass operator based elliptical curve anti-bypass attack method

Abstract

The invention discloses an ellipse curve method for anti bypass attack based on the bypass operator, belonging to the technical field of information security, which comprises the following steps: firstly the mistakes of the prior technical proposal are modified to get the correct bypass equivalent execution sequence of the doubled point-point addition operation of the ellipse curve in the finite field Fp and the bypass equivalent execution sequence is expressed as a correct operator module matrix of doubled point-point addition of the ellipse curve; then aiming at the code mechanism of the ellipse curve, an implementation scheme of the C++ software is made, and the core steps of the encryption and decryption of the code mechanism of the ellipse curve is achieved in the software technical proposal, namely, a scalar point multiplication operation of the ellipse curve based on the bypass operator in the finite field. The invention has an advantage of improving the anti bypass-attack ability of the code of the ellipse curve according to adding correct pseudo operation sequence.

Description

technical field [0001] The invention relates to a method in the technical field of information security, in particular to an elliptic curve anti-bypass attack method based on a bypass operator. Background technique [0002] Side channel attack (SCA) is an analysis technology based on physical characteristics. The attacker can use the characteristics of the operating environment to attack while obtaining the operating carrier of the cryptographic algorithm (computer, confidential machine, encryption box, smart card, etc.), so as to quickly obtain The key to decipher the entire cryptosystem. Elliptic Curve Cryptography (ECC) has the characteristics of short key, fast encryption and decryption speed, low power consumption, narrow bandwidth, and small storage space. It is usually used in mobile, handheld and other wireless devices. The use environment is relatively harsh and it is very vulnerable. . Therefore, it is imminent to study the high-performance elliptic curve cryptog...

AI Technical Summary

Problems solved by technology

However, it is wrong to execute the elliptic curve point multiplication operation on the prime field according to the above scheme. Although the pseudo-operation added in this scheme disturbs the intermediate execution sequence of the elliptic curve cryptographic scalar point multiplication operation, these pseudo-operations will The results of the execution do not cancel each other out

The reason for the error is that the result registers used by several pseudo-operations are related to the operation registers used by some basic operations in the subsequent intermediate execution sequence, that is, the result register of a certain pseudo-operation is the operation of some subsequent basic operations Registers, so that the introduction of pseudo-operations changes the intermediate results of the execution sequence, and its impact cannot be eliminated, and thus the wrong doubling-dot-adding operator module matrix is ​​obtained

Images