Method for strengthening the implementation of ECDSA against power analysis

Abstract

A method of inhibiting the disclosure of confidential information through power analysis attacks on processors in cryptographic systems. The method masks a cryptographic operation using a generator G. A secret value, which may be combined with the generator G to form a secret generator is generated. The secret value is divided into a plurality of parts. A random value is generated for association with the plurality of parts. Each of the plurality of parts is combined with the random value to derive a plurality of new values such that the new values when combined are equivalent to the secret value. Each of the new values is used in the cryptographic operation, thereby using the secret generator in place of the generator G in the cryptographic operation. The introduction of randomness facilitates the introduction of noise into algorithms used by cryptographic systems so as to mask the secret value and provide protection against power analysis attacks.

Description

FIELD OF THE INVENTION

[0001] This invention relates to a method for minimizing the vulnerability of cryptographic systems to power analysis-type attacks.

BACKGROUND OF THE INVENTION

[0002] Cryptographic systems generally owe their security to the fact that a particular piece of information is kept secret. When a cryptographic algorithm is designed, it is usually assumed that a potential attacker has access to only the public values. Without the secret information it is computationally infeasible to break the scheme or the algorithm. Once an attacker is in possession of a piece of secret information they may be able to forge the signature of the victim and also decrypt secret messages intended for the victim. Thus it is of paramount importance to maintain the secrecy and integrity of the secret information in the system. The secret information is generally stored within a secure boundary in the memory space of the cryptographic processor, making it difficult for an attacker to gain direct access to the secret information. Manufacturers incorporate various types of tamper-proof hardware to prevent illicit access to the secret information. In order to decide how much tamper proofing to implement in the cryptographic system, the designers must consider the resources available to a potential attacker and the value of the information being protected. The magnitude of these resources is used to determine how much physical security to place within the device to thwart attackers who attempt to gain direct access to the secure memory. Tamper-proof devices can help prevent an attacker who is unwilling or unable to spend large amounts of time and money from gaining direct access to the secret information in the cryptographic system. Typically, the amount of work that is required to defeat tamper proof hardware exceeds the value of the information being protected.

[0003] However, a new class of attacks has been developed on cryptographic systems that are relatively easy and inexpensive to mount in practice since they ignore the tamper-proof hardware. Recent attacks on cryptographic systems have shown that devices with secure memory may leak information that depends on the secret information, for example in the power usage of a processor computing with private information. Such attacks take advantage of information provided by an insecure channel in the device by using the channel in a method not anticipated by its designers, and so render redundant any tamper proofing in the device. Such insecure channels can be the power supply, electromagnetic radiation, or the time taken to perform operations. At particular risk are portable cryptographic tokens, including smart cards, pagers, personal digital assistants, and the like. Smart cards are especially vulnerable since they rely on an external power supply, whose output may be monitored non-intrusively. Access to the power supply is required for proper functioning of the device and so is not usually prevented with tamper-proof hardware.

[0004] Further, constrained devices tend not to have large amounts of electromagnetic shielding. Since the device is self-contained and dedicated, the power consumption and electromagnetic radiation of the smart card may be monitored as the various cryptographic algorithms are executed. Thus in a constrained environment, such as a smart card, it may be possible for an attacker to monitor an unsecured channel that leaks secret information. Such monitoring may yield additional information that is intended to be secret which, when exposed, can significantly weaken the security of a cryptographic system.

[0005] In response to the existence of such unsecured channels, manufacturers have attempted to minimize the leakage of information from cryptographic devices. However, certain channels leak information due to their physical characteristics and so it is difficult to completely eliminate leakage. A determined attacker may be able to glean information by collecting a very large number of samples and applying sophisticated statistical techniques. In addition, there are severe restrictions on what can be done in hardware on portable cryptographic tokens that are constrained in terms of power consumption and size. As a result, cryptographic tokens are particularly vulnerable to these types of attacks using unsecured channels.

[0006] The more recent attacks using the power supply that can be performed on these particularly vulnerable devices are simple power analysis, differential power analysis, higher order differential power analysis, and other related techniques. These technically sophisticated and extremely powerful analysis tools may be used by an attacker to extract secret keys from cryptographic devices. It has been shown that these attacks can be mounted quickly and inexpensively, and may be implemented using readily available hardware.

[0007] The amount of time required for these attacks depends on the type of attack and varies somewhat by device. For example it has been shown that simple power analysis (SPA) typically takes a few seconds per card, while differential power analysis (DPA) can take several hours. In order to perform SPA, the attacker usually only needs to monitor one cryptographic operation. To perform DPA, many operations must be observed. In one method used, in order to monitor the operations, a small resistor is connected in series to smart card's power supply and the voltage across the resistor is measured. The current used can be found by a simple computation based on the voltage and the resistance. A plot of current against time is called a power trace and shows the amount of current drawn by the processor during a cryptographic operation. Since cryptographic algorithms tend to perform different operations having different power requirements depending on the value of the secret key, there is a correlation between the value of the secret key and the power consumption of the device.

[0008] Laborious but careful analysis of end-to-end power traces can determine the fundamental operation performed by the algorithm based on each bit of a secret key and thus, be analyzed to find the entire secret key, compromising the system. DPA primarily uses statistical analysis and error correction techniques to extract information that may be correlated to secret keys, while the SPA attacks use primarily visual inspection to identify relevant power fluctuations. In SPA, a power trace is analyzed for any discernible features corresponding to bits of the secret key. The amount of power consumed varies depending on the executed microprocessor instructions. For example, in a typical “square-and-multiply” algorithm for exponentiation, a bit 1 in the exponent will cause the program to perform both squaring and multiply operations, while a bit 0 will cause the multiply operation to be skipped. An attacker may be able to read off the bits of a secret exponent by detecting whether the multiply operation is performed at different bit positions.

[0009] A DPA attack attempts to detect more subtle features from the power traces and is more difficult to prevent. To launch a DPA attack, a number of digital signatures are generated and the corresponding power traces are collected. The power trace may be regarded as composed of two distinct parts, namely signal and noise. The patterns that correspond to private key operations tend to remain more or less constant throughout all power traces. These patterns may be regarded as the signal. The other parts of the computation, which correspond to changing data, result in differing patterns in each power trace. These patterns can be regarded as the noise. Statistical analysis can be performed on all the power traces to separate the signal from the noise. The secret value is then derived using the identified signal.

[0010] Various techniques for preventing these power analysis attacks have been attempted to date. Manufacturers of smart cards and smart card processors have introduced random wait states and address scrambling. Smart card algorithms avoid performing significantly different operations depending on the value of a secret key and also avoid conditional jump instructions. Hardware solutions include providing well-filtered power supplies and physical shielding of processor elements or the addition of noise unrelated to secrets. However, the vulnerabilities to DPA result from transistor and circuit electrical behaviors that propagate to exposed logic gates, microprocessor operation, and ultimately the software implementations. Cryptographic algorithms to date have been designed with the assumption that there is no leakage of secret information, however with the advent of successful power analysis attacks, it is no longer prudent to assume that a cryptographic device which will leak no secret information can be manufactured. Information stored in constrained environments is particularly difficult to protect against leakage through an unsecured channel during cryptographic operations.

[0011] Accordingly, there is a need for a system for reducing the risk of a successful power analysis attack and which is particularly applicable to current hardware environments.

SUMMARY OF THE INVENTION

[0012] In accordance with this invention, there is provided a method of inhibiting the disclosure of confidential information through power analysis attacks on processors in cryptographic systems. The method of masking a cryptographic operation using a generator G comprises the steps of:

[0013] a) generating a secret value, which may be combined with the generator G to form a secret generator;

[0014] b) dividing the secret value into a plurality of parts;

[0015] c) generating a random value for association with the plurality of parts;

[0016] d) combining each of the plurality of parts with the random value to derive a plurality of new values such that the new values when combined are equivalent to the secret value; and

[0017] e) using each of the new values in the cryptographic operation, thereby using the secret generator in place of the generator G in the cryptographic operation.

[0018] The introduction of randomness facilitates the introduction of noise into algorithms used by cryptographic systems so as to mask the secret value and provide protection against power analysis attacks.

BRIEF DESCRIPTION OF THE DRAWINGS

[0019] An embodiment of the invention will now be described by way of example only with reference to the accompanying drawings in which:

[0020] FIG. 1 is a schematic diagram of a constrained device;

[0021] FIG. 2 is a schematic representation of steps of a method performed by the device of FIG. 1; and

[0022] FIG. 3 is a flow diagram illustrating an embodiment of the invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0023] A mechanism for protection against power analysis attacks on cryptographic systems involves the introduction of random values into existing algorithms employed by cryptographic systems. These random values are intended to introduce noise into the system.

[0024] This technique can be applied to a number of cryptographic systems, including encryption algorithms, decryption algorithms, signature schemes, and the like. In the preferred embodiment, the technique is applied to the ECDSA (elliptic curve digital signature algorithm) on a constrained device, typically a smart card, in order to inhibit the leakage of secret information.

[0025] In the ECDSA, as described in the ANSI X9.62 standard, the public values are:

[0026] The domain parameters: An elliptic curve group E generated by a point G, and a finite field F.

[0027] The signer's long-term public key D (corresponding to a long-term private key d).

[0028] The signature (r, s).

[0029] FIG. 1 shows generally a smart card (10) for use in a cryptographic system. The smart card incorporates a random number generator (RNG) (11), which may be implemented as hardware or software. The card also includes a cryptographic module (CRYPTO) (14), which may be for example a cryptographic co-processor or specialized software routines. The card includes a memory space (13) for storage needed while making computations, and a parameter storage space (17,18,19,21) for storing the parameters G, G′, β1, β2 of the system. The card also includes a secure memory space (15,16) for storing its private key d split into two parts d1 and d2, and a processor (12) which may be, for example, an arithmetic logic unit, an integrated circuit, or a general purpose processing unit.

[0030] In order to generate a digital signature using an elliptic curve, the signer first computes an elliptic curve point K=kG, where k is a random number and G is the generating point of the elliptic curve group. The value k is selected as a per-message secret key and the point K serves as the corresponding per-message public key. The values k and K are also referred to as an ephemeral private key and an ephemeral public key respectively. These values are used to generate a signature (r, s) wherein:

K=kG

[0031] r=Kx mod n, where Kx is the x coordinate of K and n is the order of the generating point G; and

[0032] s=k−1(e+dr) mod n, where e is the message to be signed.

[0033] The ANSI X9.62 standard provides techniques for interpreting the bit strings corresponding to finite field elements as integers in the above calculations. The standard also provides some guidelines on what elliptic curve groups and finite fields can be used.

[0034] Several algorithms, using both direct and indirect methods, may be used to compute kG in order to obtain the elliptic curve point K. Algorithms to compute signature components are potentially vulnerable to power analysis attacks since they perform different operations depending on the bits in the secret values. Repeated iterations of the algorithm use the same secret values, and so their power traces are statistically correlated to the secret values.

[0035] In order to mask a private key or other secret value to improve resistance to DPA-like attacks, a random value is introduced into the algorithm as shown in FIG. 2. This random value avoids repeated use of a secret value in order to eliminate correlation among the power traces. There will be no signal to differentiate from the background noise since no operation is repeated on subsequent iterations of the algorithm.

[0036] In the case of a long-term private key, the private key d is split into two parts d1 and d2 such that d=d1+d2. As seen in FIG. 2, the card generates its private key d (110), then computes the public key dG (112). The public key is sent to the server (114), which keeps it in a directory for future use. A smart card is initialized with a private key d being split into the values d1=d (118) and d2=0 (116) as is illustrated in FIG. 2. The initialization is performed either by embedding the private key at manufacture or by instructing the smart card to generate its own private key. These initial values d1 and d2 are stored in the device instead of storing the value for d. Each time a digital signature is generated, a random value Δ is generated using the hardware random number generator 11 and d1 and d2 are updated as follows:

d 1 =d 1(old) +Δ (mod n), and d2=d2(old)−Δ (mod n).

[0037] The formula for s, one component of the digital signature, then becomes:

s=k −1 (e+(d1r+d2r)) mod n.

[0038] When computing the above formula, the quantities d1, and d2 are essentially random values because of the random quantity Δ that is introduced after each signature. When comparing subsequent signatures, there is no correlation in the side channels to either the calculation of d,r or d2r corresponding to the secret key d since the quantities d1 and d2 are randomized in each successive signature but only together does the correlation to d emerge and this changes every time. As a result, leakage of the private key d is minimized when computing the component s of the digital signature. However, the component r of the digital signature is also calculated using the private key k and the calculation of r has still in the past been vulnerable to power analysis type attacks. In order to compute r, the signer must compute kG and so information about the value of the secret key k may leak during the repeated group operations.

[0039] In order to protect the per-message secret key k during computation of r, the signer modifies the group generator used. In order to mask the value of k, a random value β is introduced and stored for each smart card such that G′=βG where β is a random number generated for each smart card. The point G′ can be used as a secret generating point for each user, thus using the random value β to hide some information about k.

[0040] It is recognized that the signer's effective per-message secret key is kβ, corresponding to the public key kβG. The security is thus based on the secrecy of the derived value kβ, which could be computed from k and β, both of which are secret. It is also recognized that the per-message secret key may be regarded as k and the per-message public key as kG′. However, unless the point G′ were shared publicly, knowledge of k alone would not permit the computation of shared keys based on kG′.

[0041] During smart card personalization, when the private/public key pair is generated on the smart card, the point G′ is computed. The introduction of β in the calculation of a digital signature means the formula still contains a constant value, making it vulnerable to power analysis type attacks. In order to overcome these attacks, β is split into two parts β1 and β2, and those parts are updated by a random value π every time a signature is generated. This process is detailed in FIG. 3.

β1=β1(old)+π

β2=β2(old)−π

[0042] In order to verify signatures produced in this manner, the verifier uses standard ECDSA verification from ANSI X9.62 since the signer's secret key remains unchanged when using this technique.

[0043] Thus the formulae for the ECDSA signature scheme in the preferred embodiment are:

[0044] K=kG′

[0045] r=Kx mod n, where Kx, is the x coordinate of K and n is the order of the point G′; and

[0046] s =(kβ1+kβ2)−1 (e+(d1r+d 2r)) mod n

[0047] Using these formulae to compute ECDSA signatures reduces the vulnerability of the algorithm to power analysis attacks. It is recognized that similar techniques may be applied to other signatures. For example, ECNR or any other signature form could be used. These techniques may also be used individually, not necessarily in combination. Also, the ECDSA signature equation is not a necessary component of these techniques.

[0048] FIG. 3 shows the generation of a digital signature in accordance with the above protocol. First, the signer generates a random private session key k (200), and stores k (210) for future use in the algorithm. The signer updates the values β1 (224) and β2 (226) as described above by generating a random π (222) and then computes the public session key r (220). The signer then obtains the input message e or hash thereof (250). The signer then computes the signature s (260). The signer updates the private key parts d1 (264) and d2 (266) as described earlier by generating a random Δ (262).

[0049] The inverse algorithm used in the generation of the digital signature to compute k−1 is also potentially vulnerable to power analysis attacks since it performs repeated operations on the secret key every time a signature is generated. This vulnerability is reduced in a further embodiment by introducing a random w and computing (kw)−1 instead of W−1. The signing formula works since k−1=w(kw)−1.

[0050] Thus the formulae for the ECDSA signature scheme in this embodiment are:

K=kG′

[0051] r=Kx mod n, where Kx is the x coordinate of K and n is the order of the point G′; and

s=w (kwβ1+kwβ2)−1 (e+(d1r+d 2r)) mod n.

[0052] Updating the parts of the private key may occur before or after the generation of the random w.

[0053] In a further embodiment, since G′=β1G+β2G, the value of kG′ can be computed as (kβ1)G+(kβ2)G. In this way, the value of k is masked when computing kG′, even if the value of β is determined. The formula for K then becomes: K=(kβ1)G+(kβ2 )G.

[0054] Although the invention has been described with reference to certain specific embodiments, various modifications thereof will be apparent to those skilled in the art without departing from the spirit and scope of the invention as outlined in the claims appended hereto. For example, it is not necessary that there be two components combining to make the private key.

Claims

1. A method of masking a cryptographic operation using a generator G, said method comprising the steps of: a) generating a secret value; b) dividing said secret value into a plurality of parts; c) generating a random value for association with said plurality of parts; d) combining each of said plurality of parts with said random value to derive a plurality of new values such that the new values when combined are equivalent to said secret value; and e) using each of said new values in said cryptographic operation, thereby using a secret generator corresponding to a product of said secret value and said generator G in place of said generator G in said cryptographic operation.

2. The method of claim 1, wherein said secret value is updated by said random value each time a digital signature is generated.

3. The method of claim 2, said secret key value, when divided into first and second parts, has said random value added said first part and subtracted from said second part such that the sum of said first and second parts and said associated random value is equivalent to said original secret value.

4. The method of claim 1, wherein said cryptographic system is an elliptic curve digital signature algorithm.

5. The method claim 1, wherein said cryptographic system employs Montgomery's algorithm for the calculation of a digital signature.

6. A method of computing a digital signature on a message m, said signature being computed by a signer having a private key d and a public key dG, where G is a generator of a cryptographic group, said method comprising: a) dividing said private key d into a plurality of private key parts; b) presenting a masking value β; c) generating an ephemeral private key k; d) computing an ephemeral public key kG′ corresponding to a product of said masking value β and said generator G; e) computing a value e derived from said message m by application of cryptographic function; f) computing a signature component utilising said masking value β, said plurality of private key parts, said ephemeral public key kG′, and said value e.

7. A method according to claim 6, wherein said masking value is presented as a plurality of masking value parts, and at least one of the computation of said ephemeral public key kG′ and the computation of said signature component uses said plurality of masking value parts.

8. A method according to claim 7, wherein said plurality of private parts comprises a pair of values d1,d2 with d=d1+d2.

9. A method according to claim 8, wherein said plurality of masking value parts comprises a pair of values β1, β2 with β=β1+β2.

10. A method according to claim 9, wherein said signature component is computed as s=(kβ1+kβ2)−1(e+d1r+d2r) mod n, where n is an order of said cryptographic group.

11. A method according to claim 9, further comprising the step of generating a random value w, and wherein the step of computing said signature component utilises said random value w.

12. A method according to claim 10, wherein said signature component is computed as S=W(kwβ1+kwβ2)−1(e+d1r+d2r) mod n, where n is an order of said cryptographic group.

13. A method of computing a public key corresponding to a private key d in a cryptosystem, wherein the cryptosystem uses a generator G, said method comprising the steps of: a) representing a masking value β as a plurality of values which may be combined to obtain said masking value; b) combining each of said plurality of values with said private key to obtain a plurality of private key components; c) combining each of said plurality of private key components with said generator to obtain a plurality of public key components; d) combining said public key components to obtain said public key.

14. A method according to claim 12, wherein said plurality of public key components are combined by addition.

15. A method according to claim 12, wherein said plurality of values are combined with said private key by multiplication.

16. A method according to claim 12, wherein said plurality of private key components are combined with said generator by exponentiation.

17. A method according to claim 12, wherein said public key is computed as (dβ1 )G+(dβ2)G .

18. A method of computing an ECDSA signature on a message m, said method being performed by a signer having a private key d and a public key dG, where G is a generator, said signature comprising an ephemeral public key r corresponding to an ephemeral private key k and a signature component s derived from said message, m, said ephemeral private key k, and said private d, said method characterised in that the computation of said signature comprises the steps of: a) dividing said private key d into a plurality of private key parts; b) presenting a masking value β; c) generating an ephemeral private key k; d) computing an ephemeral public key kG′ corresponding to a product of said masking value β and said generator G; e) computing a value e derived from said message m by application of cryptographic function; f) computing a signature component utilising said masking value, said plurality of private key parts, said ephemeral public key kG′, and said value e.

19. A method according to claim 17, wherein said masking value is presented as a plurality of masking value parts, and at least one of the computation of said ephemeral public key kG′ and the computation of said signature component uses said plurality of masking value parts.

20. A method according to claim 18, wherein said plurality of private parts comprises a pair of values d1,d2 with d=d1+d2.

21. A method according to claim 20, wherein said signature component is computed as s=(kβ1+kβ2)−1(e+d1r+d2r) mod n, where n is an order of said cryptographic group.

22. A method according to claim 19, wherein said plurality of masking value parts comprises a pair of values β1, β2 with β=β1+β2.

23. A method according to claim 20, further comprising the step of generating a random value w, and wherein the step of computing said signature component utilises said random value w.

24. A method according to claim 21, wherein said signature component is computed as s=w(kwβ1+kwβ2)−1 (e+d1r+d2r) mod n, where n is an order of said cryptographic group.

25. A method of inverting an element k of a finite field, comprising the steps of: a) generating a random value w; b) computing wk and the inverse (wk)−1 thereof; c) computing k−1 as w(wk)−1.