Method and apparatus for finite field basis conversion

CA 02263056 1999-02-26

METHOD AND APPARATUS FOR FINITE FIELD BASIS CONVERSION

The present invention relates to cryptographic systems and more particularly, to the conversion of elements in a finite field having one basis to elements of a finite field having another basis and wherein the elements are used in a cryptographic operation.

BACKGROUND OF THE INVENTION

Cryptographic operations are generally implemented on elements in a finite field.

Various finite fields are of interest to cryptographers for example, the multiplicative groups of prime fields F(p), the multiplicative group of finite fields of characteristic two, F(2ⁿ) and elliptic curve groups over finite fields, E(F_P) or E{F_r ). The elements in a given finite field are represented in terms of a basis for the finite field. The bases are also elements of the finite field.

Certain efficiencies may be realized in cryptographic operations by choosing a particular set of bases for that finite field. For example, in the finite field F(2ⁿ), two common choices of bases of the polynomial basis and a normal basis. A problem arises though in the choice of basis since communication between the two parties, although using the same cryptographic scheme but having different bases elements, requires the parties to perform a basis conversion operation on the field elements in order to obtain the same cryptographic result.

In general, if we let F(qⁿ) be a finite field, where q is a prime or a prime power, the degree of the field is n and its order is qⁿ. A basis for the finite field is a set of n elements b₀, bi,.. .b_m.j e F(qⁿ) such that every element A of the finite field can be represented uniquely as a linear combination of basis elements:

/1—1 /=0 where the a,· e F(q) are the coefficients. Arithmetic operations are then performed on this ordered set of coefficients.

It may be seen then generally that by using a different basis, a different ordered set of coefficients is used.

CA 02263056 1999-02-26

Various techniques have been implemented to convert between two choices of basis for a finite field. A conventional approach involves using a matrix multiplication, wherein basis conversion is performed using a change of basis matrix m, resulting in a matrix of size m². If m is typically 160 bits, then this occupies significant storage in devices such as a smart card. General finite field techniques are described in the Handbook of Applied Cryptography”, CRC Press, 1996 by S.A. Vanstone et al and incorporated herein by reference. Other techniques for basis conversion are described in United States Patent No. 5,854,759 to Kaliski et al, also incorporated herein by reference.

SUMMARY OF THE INVENTION

The present invention seeks to provide a method and apparatus for basis conversion, that is generally efficient in terms of memory and computation time and is particularly adapted for use with smart cards and other low power cryptographic tokens.

In accordance with this invention, there is provided a method for basis conversion, the method comprising the steps of a first correspondent transmitting an element represented in a first basis to an intermediate processor; the intermediate processor converting the element into a second basis representation; forwarding said converted element to the first correspondent; and the first correspondent operating on the converted element in a cryptographic operation.

BRIEF DESCRIPTION OF THE DRAWINGS

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:

Figure 1 is a schematic diagram of an embodiment of a basis conversion system in accordance with the present invention;

Figure 2 is a schematic diagram of a further embodiment of a basis conversion system in accordance with the present invention; and

Figure 3 is a flow diagram illustrating a key exchange scheme in accordance with an embodiment of the invention.

CA 02263056 1999-02-26

DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to figure 1, a method according to a first embodiment of the invention is shown generally by numeral 10. In this embodiment, a pair of correspondents are represented by A and B and an intermediate processor, such as a server, certifying authority or other helper processor, is represented by H. It is assumed the correspondents A and B include processors for performing cryptographic operations and the like. Specifically, A and B perform cryptographic operations n a basis βι and β₂, respectively. It is further assumed that the respective cryptographic parameters are contained within the entities A and B. For example in an elliptic curve scheme the system parameters include at least a point P on the elliptic curve, the order of the curve and the parameters of the elliptic curve equation E.

In this embodiment, the entities A and B generates a respective random value k_hgenerally the private session key and each compute a public value kP, represented in terms of their respective bases β_} and /¾. One of the entities, A for example, transmits its public key kP$\ to the server H. The server H performs a basis conversion utilizing one of many basis conversion algorithms to convert the public key kP$\ represented in basis βι to a public key kP$₂represented in terms of the basis /½. The converted key is transmitted back to the correspondent A. The correspondent A then computes signature s = k‘^l(h(m) + dr), where r = kP^₂. The signature s and r are then transmitted to the other correspondent B, which is then processed by B in the basis β₂. Similarly if correspondent B wishes to communicate with A it also transmits its public key kP_p2 to the server, which performs the conversion on the key and sends it back to the correspondent B. The correspondent B also computes a signature using r = kP^.

In this embodiment, a helper or an intermediate processor is utilized to perform the basis conversion. Furthermore the cryptographic scheme is not compromised since the public key may be transmitted in the clear, without requiring a secure communication path between the correspondent and the server.

Referring to figure 2, a second embodiment according to the invention, is shown generally by numeral 20. In this embodiment, each of the correspondents A and B have a respective public key aP represented in terms of basis βι and bP represented in terms of basis β₂. The first correspondent A transmits its public key aP to the server H which performs the basis conversion on the element to a representation basis β and transmits this key aP_b2 to the second

CA 02263056 1999-02-26 correspondent B. The second correspondent B also transmits its public key bPhi to the server where a basis conversion is performed on the key to the basis of the first correspondent. The key hP$\ is forwarded to the first correspondent A. Each of the correspondents then compute a common key by combining its private key with the other correspondents received public key.

Thus, A computes abP$i and B computes baP^·

The correspondents have now performed a key exchange, each having a shared key, and only one of the correspondents need perform a basis conversion. The keys may then be used in subsequent steps of the encryption scheme.

In a third embodiment, again it is assumed that the correspondents A and B operate in bases βΐ and β2 respectively. The bases βΐ and β2 may represent any basis. Furthermore, we define a field element a such that correspondent A represents the element a in terms of the basis βΐ and correspondent B represents the field element in terms of basis β2. The correspondents make use of a bit string that is a function of a sequence of traces of the field element as a shared secret to perform the certain cryptographic operations.

In this embodiment if we let p be a prime and let q =p^m, where m >1. Let F_q be the finite field having q elements and Fqⁿ, the n-dimensional extension. The cyclic group G of Fqⁿ over Fq is generated by the mapping σ(ά) = , Oie Fqⁿ, and is of order n. We may then define the trace function of Fqⁿ over F_q as n-l

<img file="CA2263056A1_D0001.tif" />

For brevity, the trace function is simply represented as Tr. In the method of the present invention we make use of the property that the traces Tr(oi_Pi) = Tr(Oip₂), that is the traces of an element (X represented in terms of a basis βΐ is the same as the trace of the element represented in terms of basis β2.

If a key of length n = 128 bits is to be constructed, then the traces of odd powers of a are taken. The traces, namely Tr(ct), Tr( a ³),.. .Tr(a²⁵⁷), are either 0 or 1. Since the trace is independent of the representation and it does not matter, which one of the entities performs the trace. As an aside it may be noted that we could also use the trace Tr(fi(a)).. .Tr(fk(a)) that is the

CA 02263056 1999-02-26 trace of F(2ⁿ) maps to the elements [0,1] or F(2). Therefore, fimaps F (2ⁿ) to F (2). In general, any invariant function may be utilized for the trace.

In general if F(qⁿ) is the finite field and F(q) is the ground field over which it is defined, the elements of the finite field can be represented in a number of ways depending on the choice of basis. Two common types of basis are polynomial basis and normal basis. If β 1 is a polynomial basis, then the basis elements may be represented as 1, β, β²,.. .β^η_1, where β is a root or generator. Assuming the function f(x) = 0 and f(x) is an irreducible of degree n i.e irreducible over the ground field . Then, if a field element is given by a = ao + ai β¹ ... + a_n.i β^η_1, the trace is given by

Tr(a) = ao + a,Tr(P) + a₂Tr(p² )... + a_n., Tr(p^{n l}).

It may be observed that the trace is linear and if the irreducible f(x) has the form xⁿ + g(x) where the degree of g(x) is k, then Tr^) - 0 for j = 1, 2 ...n-k-1.

If the irreducible polynomial is given by xⁿ + an-ix^{n 1} + an_₂x^{n 2} .... + ai and if a^i = 0 then Ττ(β) = 0, and a_n_i = 0 and a_n-2 = 0 then Ίτ(β²) = 0. The observation is that if consecutive coefficients of the field element a are zero then the trace of that number of terms is zero.

Thus, we may use the trace bit string as a shared secret to perform the remaining cryptographic operations. In deciding upon a key, the users (correspondents) normally select a bit string that is a function of a sequence of traces of a selected field element. For example if a bit string (key) of length 3 is desired, the trace of a, a³, a² could be used. The order of the sequence of traces may on occasion be arbitrarily chosen but known to the correspondents. The following examples more clearly illustrate the derivation of a key.

Examplel : In this example the trace of a and a³ is used to create a binary key of length 2.

Basis 1 : The irreducible chosen is f(x) = x³ + x+ l=O;x³ = x+ l

Element a in this basis is a - (1 + x²) then the key = (Tr(a), Tr(a³))

Tr(l) -1 + 1²+1⁴=1; (x⁴ = x² + x)

Tr(x) = x + x² + x⁴ = x + x² + x² + x = O

CA 02263056 1999-02-26

Tr(x²) = x² + x⁴ + x⁸ = x² + (x² + x) + (x² + x)²= x + (x² + x) + x² = 0

Tr(a) = Tr(l+x²) = Tr(l) + Tr(x²) = 1 + 0 = 1 a = a.a¹ = (1+ x²)(l+x²)² =(1+ x²)(l + x⁴) = (1 +x²)( 1 + x + x²) = 1 + x + x² + x² + x³ + x⁴= 1 + x + x³ + x⁴ = 0 + x² + x = x² + x

Tr(cc³) = Tr(x²) + Tr(x) = 0 + 0 = 0 Thus the key = (1,0)

Example 2:In this example a different basis is used (basis 2) and a is converted to its representation in this basis by (1) finding a root r for the polynomial for basis 1 in the representation generated by basis 2, and (2) then evaluating the polynomial representing a in basis 1 at r. The traces of a and a³ are calculated in basis 2 to generate the same binary key as was created in basis 1 above.

Basis 2: The irreducible chosen is g(y) = y³ + y² + 1 ; y³ = y² + 1

To find a in basis 2, find a root of f(x) = x³ + x + 1 (the irreducible in basis 1) in basis 2.

Note: (y+1)³ + (y+1) + l=y³ + y² + y+ l +y+l+l=0+y+l+y+l=0

Let r = y + 1, then a = 1 + x² -» a' = 1 + r² == 1 + (y +1)² = 1 + y² + 1 = y²Key = (Tr(a'), Tr(a')³); y⁴ = y³ + y = y² + y +1

Tr(l) = 1 + 1 + 1

Tr(y) =y + y² + y⁴ = y + y² + y² + y+ l = l

Tr(y2) = y² + y⁴ + y⁸ = y² + y² + y + 1 + (y² + y + I)²= y + 1 + y⁴ + y² +1 = y⁴ + y² + y = y² + y+ l+y² + y= l

Tr(a') =Tr(y²)=l (a’)³ = y6 = (y³)² = (y² + l)² = y⁴ + 1 = y² + y + 1 + 1 = y² + y

CA 02263056 1999-02-26

Tr((a')³) - Tr(/ + y) = Tr(y²) + Tr(y) -1 + 1=0 Thus the key = (1,0) as in basis 1.

Referring to figure 3, a key agreement scheme according to an embodiment of the invention is shown generally numeral 30. The correspondents A and B operate in bases pl and β2 respectively. The bases pl and P2 may represent any basis. Furthermore A and B each have the following system parameters, a long term private key d and a long-term public key Qa = d_aP and Qb = dbP, where P is a point on an elliptic curve represented in terms of the respective bases. The correspondent A represents P in terms of the basis pi and correspondent B represents P in terms of basis p2. In a typical Diffie-Hellman key agreement scheme, each of the correspondents A and B generate respective ephemeral private keys k_A and k_B and compute a corresponding short term (session) public keys k_APpi and k_BPp2. A and B exchange their respective public keys, and convert them to their own basis. If the correspondents are low power devices, such as smart cards or the like, then basis conversion may be performed by an intermediate processor such as described with reference to figures 1 and 2. Alternatively, if the correspondents have sufficient compiling power, then basis conversion may be performed by the correspondents themselves, according to one of many basis conversion methods. In any event, after the basis conversion, correspondent A has B’s public key (W^) pi and B has A’s public key (ÀjPpi) ρ2· A shared secret is computed in their respective basis by computing k_A(£gPp2) ρι=αρι and k_B(^Ppi) p2=ctp2Each of the correspondents takes a sequence of traces of their respective field element a to derive a common bit string.

Applying the method to a signature scheme, the correspondent A generates its ephemeral public session key A?Ppi. A trace sequence may be constructed, for example, of the x-coordinate of kP$\ producing a bit string T. The bit string is passed through a hash function g to derive a signature component r. A second signature component s- = k~^l (m + dr) is computed, where d is A’s long term private key. The signature components are transmitted to B for verification. The verifier B computes E'ms'¹ Pp2+rs-lQ^ 32,= kP^ where Qj 32 is the long term public key of A in basis 2. This basis conversion could be performed by A using an intermediate H as described earlier. B then generates a sequence on the computed value kP^ and applies the hash function g to derive a value r*. If r-r, then the signature is verified.

CA 02263056 1999-02-26

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.