Abstract:
A method of generating a key by a first correspondent. The key is computable by a second correspondent. The method comprises the steps of:  
     a) making available to the second correspondent a first short term public key;  
     b) obtaining a second short term public key from the second correspondent;  
     c) computing a first exponent derived from the first short term private key, the first short term public key, and the first long term private key;  
     d) computing a second exponent derived from the first short teem private key, the first long term public key, the second short term public key and the first long term private key;  
     computing a simultaneous exponentiation of the first exponent with the second short term public key and the second exponent with the second long term public key.

Description:
[0001]    This application claims the benefit of U.S. Provisional Application 60/343,224, filed Dec. 31, 2001, the contents of which are incorporated herein by reference. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    The present invention relates to cryptographic systems, and more particularly to a method for computing a shared secret key.  
           [0004]    2. Description of the Prior Art  
           [0005]    Public key cryptography is used to provide security for information transmitted over public networks. Numerous cryptographic protocols are available to provide security, integrity and authentication. Their security is based on the apparent intractability of certain mathematical problems, such as integer factorization and the discrete logarithm problem. Public key schemes sometimes require more computing power than is generally available in constrained environments. Devices such as cellular phones, pagers, and smart cards usually have limited computing power and battery power available. In such environments, elliptic curve cryptography is particularly appealing since it provides security with parameters having a smaller number of bits. Computations are correspondingly faster because of the smaller amount of data that must be manipulated. In most cryptographic systems, parameters with a larger number of bits provide greater security at the cost of speed. Accordingly, there is a continual need to optimize cryptographic operations to run as quickly as possible, to make higher security implementations of the protocols feasible.  
           [0006]    Digital signatures are a class of cryptographic protocols used to provide authentication. As in all public key systems, a sender has a private key and a public key. The public key is made available and authenticated to other users through a certificate or a directory. The sender signs a message using their private key, and a recipient is able to verify the signature by using the authentic public key. The mathematics of the scheme provides assurance that only the owner of the private key could generate a signature that will verify using the public key.  
           [0007]    It is often of interest to share a key between two users of a public key cryptosystem. This key can be used to secure future communications using a symmetric key cryptosystem. The MQV (Menezes, Qu, Vanstone) protocol provides a method of sharing a key between two users of a public key cryptosystem that provides authentication of the key. This protocol is described in U.S. Pat No. 5,761,305, U.S. Pat. No. 5,889,865, U.S. Pat. No. 5,896,455, and U.S. Pat. No. 6,122,736.  
           [0008]    The following notation is used for the MQV protocol in a group G with a generator g  
                                   Term   Meaning                   x   Alice&#39;s ephemeral private key       y   Bob&#39;s ephemeral private key       R A     Alice&#39;s ephemeral public key g x         R B     Bob&#39;s ephemeral public key g y         a   Alice&#39;s long-term private key       b   Bob&#39;s long-term private key       Y A     Alice&#39;s long-term public key g a         Y B     Bob&#39;s long-term public key g b         s A     An intermediate component of the key computed by Alice       s B     An intermediate component of the key computed by Bob                  
 
           [0009]    An early version of the MQV protocol for sharing a key between a pair of correspondents Alice and Bob proceeds as follows in the multiplicative group of a finite field having group order q.  
           [0010]    1. Alice selects x at random from the interval 1 to q−1.  
           [0011]    2. Alice computes R A =g x  and sends it to Bob.  
           [0012]    3. Bob selects y at random from the interval 1 to q−1.  
           [0013]    4. Bob computes R B =g y  and sends it to Alice.  
           [0014]    5. Alice computes s A =(x+aR A )mod q and the shared secret K=(R B (Y B ) R     B   ) s     A   .  
           [0015]    6. Bob computes s B =(y+bR B )mod q and the shared secret K=(R A (Y A ) R     A   ) s     B   .  
           [0016]    The computationally intense parts of the key agreement protocol are the exponentiations that must be performed to determine K.  
           [0017]    When the MQV protocol was standardized in the ANSI X9.62 and IEEE P1363 standards, a truncation operation was introduced to make the protocol more efficient. The MQV protocol as standardized uses a truncation operation to reduce the bit length of an exponent. The truncation operation is denoted by {overscore (X)} and is defined as {overscore (X)}=(X mod2 80 )+2 80 . The protocol then proceeds as follows:  
           [0018]    1. Alice selects x at random from the interval 1 to q−1.  
           [0019]    2. Alice computes R A =g x  and sends it to Bob.  
           [0020]    3. Bob selects y at random from the interval 1 to q−1.  
           [0021]    4. Bob computes R B =g y  and sends it to Alice.  
           [0022]    5. Alice computes s A =(x+a{overscore (R)} A )mod q and the shared secret K=(R B (Y B ) {overscore (R)}     B   ) s     A   .  
           [0023]    6. Bob computes s B =(y+b{overscore (R)} B )mod q and the shared secret K=(R A (Y A ) {overscore (R)}     A   ) s     B   .  
           [0024]    The use of the truncation operation speeds up computations since the exponent is shorter. However, this means that only half of the bits of the truncated values are used. It is believed that this truncation does not affect the security of the protocol, however it is generally preferable in the design of cryptographic methods to use as many bits of the random values and private values as possible.  
           [0025]    A version of the MQV protocol uses an elliptic curve group as the underlying group G. The group generator is normally written as a point P, and additive notation is usually used instead of multiplication notation. In the Elliptic Curve MQV protocol, the value R A  is then equal to xP, and the value R B  is equal to yP. Each value R A , R B  is thus a point on the elliptic curve, Since an elliptic curve point consists of two finite field elements, it is necessary to define a function π to convert an elliptic curve point into an integer. One typical function that is used is to interpret the bit string representing the first coordinate of the elliptic curve point as a bit string representing an integer. The component s A  is equal to s A =(x+aπ(R A ))mod q and the component s B  is equal to s B =(y+bπ(R B ))mod q. The shared key may then be expressed as K=s A (R B +π(R B )Y B ). The shared key K is an elliptic curve point, and usually it will be converted into another format for use in another protocol. The conversion often involves interpreting the bit string representing K as an integer. The corresponding two point multiplications are therefore necessity to compute the shared key and are also computationally intensive.  
           [0026]    Accordingly, there is a need for a method of computing a shared key using the MQV protocols that obviates or mitigates at least some of the above disadvantages.  
         SUMMARY OF THE INVENTION  
         [0027]    In general terms, it has been recognized that the computation of the MQV shared key may be optimized by using simultaneous multiplication techniques.  
           [0028]    In accordance with one aspect of the present invention, there is provided a method of generating a key by a first correspondent. The key is computable by a second correspondent. The method comprises the steps of:  
           [0029]    a) making available to the second correspondent a first short term public key;  
           [0030]    b) obtaining a second short term public key from the second correspondent;  
           [0031]    c) computing a first exponent derived from the first short term private key, the first short term public key, and the first long term private key;  
           [0032]    d) computing a second exponent derived from the first short term private key, the first long term public key, the second short term public key and the first long term private key;  
           [0033]    computing a simultaneous exponentiation of the first exponent with the second short term public key and the second exponent with the second long term public key. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0034]    These and other features of the preferred embodiments of the invention will become more apparent in the following detailed description in which reference is made to the appended drawings wherein:  
         [0035]    [0035]FIG. 1 is a schematic representation of a cryptographic system.  
         [0036]    [0036]FIG. 2 is a flowchart showing a method performed by the correspondents in FIG. 1.  
         [0037]    [0037]FIG. 3 is a flowchart showing a method used by the method of FIG. 2.  
         [0038]    [0038]FIG. 4 is a flowchart showing another embodiment of the method of FIG. 2.  
         [0039]    [0039]FIG. 5 is a flowchart showing yet another embodiment of the method of FIG. 2.  
         [0040]    [0040]FIG. 6 is a flowchart showing an alternative method of performing the method of FIG. 3.  
         [0041]    [0041]FIG. 7 is a flowchart showing another embodiment of the method of FIG. 5.  
         [0042]    [0042]FIG. 8 is a flowchart showing a method used in the method of FIG. 7. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0043]    Referring to FIG. 1, a cryptographic system is shown generally by the numeral  10 . A pair of correspondents  12 ,  14 , referred to as Alice and Bob, communicate over a network  16 . Each correspondent has an arithmetic logic unit (ALU)  18 ,  20 . The ALU can be a general-purpose computer, with a cryptographic unit, which implements cryptographic protocols from instructions provided by software. The software may be provided on a data carrier or in memory. Each correspondent has a long-term private key a, b and a corresponding long-term public key Y A , Y B . Each correspondent has access to an authentic copy of the other correspondent&#39;s long-term public key.  
         [0044]    It is desired to share a key between the correspondents using the MQV protocol. It is recognized that the MQV equations can be reorganized to provide efficient computations without necessarily using the truncation operation The reorganization proceeds as follows.  
         [0045]    The formula K=(R B (Y B ) R     B   ) s     A    that is used to determine he key can be rearranged as K=(R B (Y B ) R     B   ) s     A   =R B   s     A   Y B   s     A     R     B   , using the notation above. This rearrangement allows the key to be computed by using a technique known as simultaneous multiple exponentiation, which uses only one set of squares.  
         [0046]    To compute the multiple K=R B   s     A   Y B   s     A     R     B   , two tables of small exponents of R B  and Y B  respectively of a predetermined width are first established. The scalars s A  and s A R B  are then examined using windows of the predetermined width. The multiples of R B  and Y B  corresponding to each window are retrieved from each respective table. The product of the table entries from the two windows is multiplied into an accumulator. The accumulator is then squared in accordance with the width of the window, and then the next window is examined. This process is repeated until each window has been examined, and therefore terminates with the accumulator holding the value of K.  
         [0047]    Referring to FIG. 2, a method of computing a shared secret key is shown generally by the numeral  100 . Alice selects an ephemeral private key x at random from the interval 1 to q−1 ( 102 ). Alice computes the corresponding ephemeral public key g x  and sends it to Bob ( 104 ). Similarly, Bob selects an ephemeral private key y at random from the interval 1 to q−1 ( 106 ). Bob computes the corresponding ephemeral public key g y  and sends it to Alice ( 108 ). Alice computes s A =(x+aR A )modq and the shared secret K=R B   s     A   Y B   s     A     R     B    ( 110 ) using simultaneous multiple exponentiation, as described below, Bob computes s B =(y+bR B )mod q and the shared secret K=R B   s     A   Y B   s     A     R     B    ( 112 ) using simultaneous multiple exponentiation.  
         [0048]    Referring to FIG. 3, a method of computing a simultaneous multiple exponentiation is shown generally by the numeral  300 . A window width of a predetermined number of bits w is first established ( 302 ). Then, a table of small exponents α of R B  is established ( 304 ) and a table of small exponents β of Y B  is established ( 306 ). The table entries consist of a column of possible bit combinations (e.g. α=1001 2 ), and a column of corresponding exponentiations (e.g. R B   1001     2   ). Then, the scalars s A  and s A R B  are examined using windows of the window width  w  ( 308 ). The powers of R B  and Y B  corresponding to each window are retrieved from each respective table ( 310 ). The product of the table entries from the two windows is multiplied into an accumulator ( 312 ). The accumulator is then squared w times in accordance with the width w of the window ( 314 ), and then the next window is examined ( 316 ). The scalars are repeatedly examined and table entries multiplied into the accumulator and  1 the accumulator squared w times for each repetition as described above ( 318 ) until the shared secret K is computed ( 320 ).  
         [0049]    It will be noted that in this embodiment one simultaneous multiple exponentiation is used instead of two separate exponentiations. Accordingly, the number of squaring operations required corresponds to the number required for one exponentiation instead of that required for two separate exponentiations. It will be recognized that using the method of this embodiment, truncating the first exponent in an attempt to save squarings is not effective, since these squaring can be shared with the second multiplication. The truncation then saves only multiplications, not squarings, when applied to this embodiment since this embodiment uses simultaneous multiple exponentiation.  
         [0050]    Referring to FIG. 4, an alternate embodiment is shown generally by the numeral  200 . In this embodiment, Alice uses the improved method of computing the shared key, while Bob can compute the shared key by any method. Alice selects ( 202 ) x at random from the interval 1 to q−1. Then, Alice computes ( 204 ) g x  and makes it available to Bob ( 206 ). Alice then obtains ( 208 ) g y  from Bob. Alice computes ( 210 ) s A =(x+aR A )mod q and then computes ( 212 ) the shared secret K=R B   s     A   Y B   s     A     R     B    using simultaneous multiple exponentiation.  
         [0051]    Referring to FIG. 5, an alternate embodiment is shown generally by the numeral  500 . In this embodiment, the correspondents of FIG. 2 are shown carrying out the method in parallel. Alice selects an ephemeral private key x at random from the interval 1 to q−1 ( 502 ). Bob selects an ephemeral private key y at random from the interval 1 to q−1 ( 106 ). Alice computes the ephemeral public key g x  corresponding to the ephemeral private key x ( 504 ). Similarly, Bob computes his ephemeral public key g y  ( 514 ). Alice sends g x  to Bob and Bob sends g y  to Alice. After Alice receives Bob&#39;s ephemeral public key, she computes s A =(x+aR A ) mod q ( 506 ). Then Alice computes the shared secret K as before ( 508 ). After Bob receives Alice&#39;s ephemeral public key, he computes s B  as before ( 516 ). Then Bob computes K as before ( 518 ). Thus, it will be understood that the order of the computations is not critical and it is only necessary that a correspondent have both its own private key and the other correspondent&#39;s, ephemeral public key before computing s and K.  
         [0052]    Referring to FIG. 6, an alternate method of computing a simultaneous multiple exponentiation is shown generally by the numeral  600 . The exponent s A  is shown stored in a register  602 . The exponent S A R B  is shown stored in a register  604 . Each register has an associated pointer  603 ,  605 . The pointers are aligned to designate corresponding bits in each exponent. A pair of switches  606 ,  608  are provided. Two multipliers  610 ,  612  are shown, although their functionality could be performed by one multiplier. An accumulator  614 , a squaring operation  616 , and a control  618  are provided.  
         [0053]    In use, the pointer  603  is an input to the switch  606  which controls multiplier  610  so that when the corresponding bit of s A  is set, the quantity R B  is multiplied into the accumulator  514 . Similarly, the pointer  605  is an input to the switch  608  which operates the multiplier  612 . The quantity Y B  is multiplied into the accumulator  614  when the corresponding bit of register  604  is set. After considering each exponent, the accumulator is squared  616 , and the control  618  operates to set the pointers  603 ,  605  to the next bits of registers  602 ,  604 . The process repeats until all the bits have been considered. In this way, the bits of the two exponents are considered simultaneously, and only one set of squares is performed.  
         [0054]    The above methods can be implemented in any group where the discrete logarithm problem is believed to be intractable. One example of such a group is an elliptic curve group, where the method is very similar however, the additive notation is usually used instead of multiplicative notation. In the elliptic curve setting, group multiplication corresponds to addition of elliptic curve points, and group exponentiation corresponds to scalar multiplication. In this case, the tables will contain a column possible bit combinations of the scalar (e.g. 1001 2 ), and a column of corresponding point multiplications (e.g. 1001 2 P).  
         [0055]    Referring therefore to FIG. 7, the method of FIG. 5 is shown in an elliptic curve setting by the numeral  700 . The correspondents have common elliptic curve parameters comprising an elliptic curve, a finite field, a base point P of order q, and a function π to convert elliptic curve points to integers. Each correspondent has a long term private key a, b and a corresponding long term public key Y A =aP, Y B =bP. Alice selects an ephemeral private key x at random from the interval 1 to q−1 ( 702 ). Bob selects an ephemeral private key y at random from the interval 1 to q−1 ( 712 ). Alice computes the ephemeral public key xP corresponding to the ephemeral private key x ( 704 ). Similarly, Bob computes his ephemeral public key yP ( 714 ). Alice sends xP to Bob and Bob sends yP to Alice. After Alice receives Bob&#39;s ephemeral public key, she computes s A =(x+aπ(R A ))mod q ( 706 ). Then Alice computes the shared secret K=s A R B +s A π(R B )Y B  ( 708 ) using simultaneous multiple scalar multiplication (FIG. 8). After Bob receives Alice&#39;s ephemeral public key, he computes s B =(y+bπ(R B ))mod q ( 716 ). Then Bob computes K=s B R A +s B π(R A )Y A  ( 718 ) using simultaneous multiple scalar multiplication (FIG. 8).  
         [0056]    Referring to FIG. 8, a method of performing simultaneous multiple scalar multiplication used in this embodiment is shown generally by the numeral  800 . A window width of a predetermined number of bits w is first established ( 802 ). Then, a table of small exponents α of R B  is established ( 804 ) and a table of small exponents β of Y B  is established ( 806 ). The table entries consist of a column of possible bit combinations (e.g. α=1001 2 ), and a column of corresponding scalar multiples (e.g. 1001 2 R B ). Then, the scalars s A  and S A π(R B ) are examined using windows of the window width  w  ( 808 ). The scalar multiples of R B  and Y B  corresponding to each window are retrieved from each respective table ( 810 ). The sum of the table entries from the two windows is added into an accumulator ( 812 ). The accumulator is then doubled w times in accordance with the width w of the window ( 814 ), and then the next window is examined ( 816 ). The scalars are repeatedly examined and table entries added into the accumulator and the accumulator doubled w times for each repetition as described above ( 818 ) until the shared secret K is computed ( 820 ).  
         [0057]    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.