A kind of rsa modular exponentiation method and device

Abstract

The present invention provides a RSA modular exponentiation method and device, wherein the method includes: acquiring information m, modulus N, random number r, public key e and private key d; calculating the first value m0, the second A value m0 is the value after the product of re-1 and the information m is modulo N; calculate a second value m1, and the second value m1 is the product of the first value m0 and the random number r taken on N The value after the modulus; calculate the third value S1, and the third value S1 is the value after taking the modulus of (m1)d‑1 to N; obtain the RSA encryption result S corresponding to the information m, and the result S is the third value The product of S1 and the first value m0 is the result of modulo N. The method and device can realize randomization of the base number of RSA with relatively small overhead, thereby avoiding power analysis attacks.

Description

technical field [0001] The invention relates to the technical field of data security, in particular to an RSA modular exponentiation method and device. Background technique [0002] In the existing RSA public key encryption algorithm modular exponentiation operation, a randomized mask is added to the base m, so that the base number actually involved in the modular exponentiation operation changes from known to unknown, from fixed to variable, thereby avoiding power consumption Analyze attacks. [0003] For example, before a decryption or signature operation is performed, a random pair of numbers (V i , V d ), so that it satisfies V d =(V i -1 ) d mod N, the pseudo-base after randomizing and covering the base m as the plaintext is: m'=mV i mod N, then after the modular exponentiation operation is completed, the corresponding modular exponentiation result obtained by using m' as the base number, that is, performing S=S'V on the pseudo-result S' d modN to recover the re...

Images