This application is a continuation of and claims priority from U.S. patent application Ser. No. 13/478,288, filed on May 23, 2012, which is a continuation of and claims priority from U.S. patent application Ser. No. 11/333,296, filed on Jan. 18, 2006, now U.S. Pat. No. 8,204,232 which claims priority from U.S. Provisional Application No. 60/644,034 filed Jan. 18, 2005. All three of the priority applications are hereby incorporated by reference.

The present invention relates to computational techniques used in cryptographic algorithms.

BACKGROUND TO THE INVENTION

The security and authenticity of information transferred through data communication systems is of paramount importance. Much of the information is of a sensitive nature and lack of proper control may result in economic and personal loss. Cryptographic systems have been developed to address such concerns.

Public key cryptography permits the secure communication over a data communication system without the necessity to transfer identical keys to other parties in the information exchange through independent mechanisms, such as a courier or the like. Public key cryptography is based upon the generation of a key pair, one of which is private and the other public that are related by a one way mathematical function. The one way function is such that, in the underlying mathematical structure, the public key is readily computed from the private key but the private key cannot feasibly be ascertained from the public key.

One of the more robust one way functions involves exponentiation in a finite field where an integer k is used as a private key and the generator of the field Î± is exponentiated to provide a public key K=Î±^k. Even though Î± and K are known, the underlying mathematical structure of the finite field makes it infeasible to obtain the private key k. Public key cryptography may be used between parties to establish a common key by both parties exchanging their public keys and exponentiating the other parties public key with their private key. Public key cryptography may also be used to digitally sign a message to authenticate the origin of the message. The author of the message signs the message using his private key and the authenticity of the message may then be verified using the corresponding public key.

The security of such systems is dependent to a large part on the underlying mathematical structure. The most commonly used structure for implementing discrete logarithm systems is a cyclic subgroup of a multiplicative group of a finite field in which the group operation is multiplication or cyclic subgroups of elliptic curve groups in which the group operation is addition.

An elliptic curve E is a set of points of the form (x, y) where x and y are in a field F, such as the integers modulo a prime p, commonly referred to as Fp, and x and y satisfy a non-singular cubic equation, which can take the form y²=x³+ax+b for some a and b in F. The elliptic curve E also includes a point at infinity, indicated as O. The points of E may be defined in such a way as to form a group. The point O is the identity of the group, so that O+P=P+O=P for any point P in E. For each point P, there is another point, which we will write as âˆ’P, such that P+(âˆ’P)=P+(âˆ’P)=O. For any three points P, Q, R in E, associativity holds, which means that P+(Q+R)=(P+Q)+R. Identity, negation and associativity are the three axiomatic properties defining a group. The elliptic curve group has the further property that it is abelian, meaning that P+Q=Q+P.

Scalar multiplication can be defined from addition as follows. For any point P and any positive integer d, dP is defined as P+P+ . . . +P, where d occurrences of P occur. Thus 1P=P and 2P=P+P, and 3P=P+P+P, and so on. We also define 0P=0 and (âˆ’d) P=d (âˆ’P).

For simplicity, it is preferable to work with an elliptic curve that is cyclic (defined below) although in practice, sometimes a cyclic subgroup of the elliptic curve is used instead. Being cyclic means that there is a generator G, which is a point in the group such that every other point P in the group is a multiple of G, that is to say, P=dG, for some positive integer d. The smallest positive integer n such that nG=O is the order of G (and of the curve E, when E is cyclic). In cryptographic applications, the elliptic curves are chosen so that n is prime.

In an elliptic curve cryptosystem, the analogue to exponentiation is point multiplication. Thus it is a private key is an integer k, the corresponding public key is the point kP, where P is a predefined point on the curve that is part of the system parameters. The seed point P will typically be the generator G. The key pair may be used with various cryptographic algorithms to establish common keys for encryption and to perform digital signatures. Such algorithms frequently require the verification of certain operations by comparing a pair of values as to confirm a defined relationship, referred to as the verification equality, between a set of values.

One such algorithm is the Elliptic Curve Digital Signature Algorithm (ECDSA) used to generate digital signatures on messages exchanged between entities. Entities using ECDSA have two roles, that of a signer and that of a verifier. A signer selects a long term private key d, which is an integer d between 1 and nâˆ’1 inclusive. The integer d must be secret, so it is generally preferable to choose d at random. The signer computes Q=dG. The point Q is the long-term public key of the signer, and is made available to the verifiers. Generally, the verifiers will have assurance generally by way of a certificate from a CA, that Q corresponds to the entity who is the signer. Finding the private key d from the public key Q is believed to an intractable problem for the choices of elliptic curves used today.

For any message M, the signer can create a signature, which is a pair of integers (r, s) in the case ECDSA. Any verifier can take the message M, the public key Q, and the signature (r, s), and verify whether it was created by the corresponding signer. This is because creation of a valid signature (r, s) is believed to possible only by an entity who knows the private key d corresponding to the public key Q.

The signing process is as follows. First, the signer chooses some integer k in the interval [1, nâˆ’1] that is to be used as a session, or ephemeral, private key. The value k must be secret, so generally it is preferable to choose k randomly. Then, the signer computes a point R=kG that has co-ordinates (x, y). Next, the signer converts x to an integer xâ€² and then computes r=xâ€² mod n, which is the first coordinate of the signature. The signer must also compute the integer e=h(M) mod n, where h is some hash function, generally one of the Secure Hash Algorithms (such as SHA-1 or SHA-256) defined in Federal Information Processing Standard (FIPS) 180-2. Finally, the second coordinate s is computed as s=(e+dr)/s mod n. The components (r, s) are used by the signer as the signature of the message, M, and sent with the message to the intended recipient.

The verifying process is as follows. First the verifier computes an integer e=h(M) mod n from the received message. Then the verifier computes integers u and v such that u=e/mod n and v=r/s mod n. Next, the verifier computes a value corresponding to the point R that is obtained by adding uG+vQ. This has co-ordinates (x, y). Finally the verifier converts the field element x to an integer xâ€² and checks that r=xâ€² mod n. If it does the signature is verified.

From the above, the verification of an ECDSA signature appears to take twice as long as the creation of an ECDSA signature, because the verification process involves two scalar multiplications, namely uG and vQ, whereas signing involves only one scalar multiplication, namely kG. Elliptic curve scalar multiplications consume most of the time of these processes, so twice as many of them essentially doubles the computation time. Methods are known for computing uG+vQ that takes less time than computing uG and vG separately. Some of these methods are attributed to Shamir, some to Solinas, and some to various others. Generally, these methods mean that computing uG+vQ can take 1.5 times as long as computing kG.

Another commonly used method to accelerate elliptic curve computations is pre-computing tables of multiples of G. Such pre-computed tables save time, because the point G is generally a fixed system parameter that is re-used repeatedly. The simplest pre-compute table consists of all multiples 2^jG for j from 0 to t, where t is the bit-length of n. With such a pre-computed table, computing an arbitrary multiple kG can be done with an average of t/2 point additions or less. Roughly, this a threefold improvement over the basic method of computing kG, which clearly demonstrates the benefit of pre-computation. Generally speaking, larger pre-computed tables yield better time improvements. The memory needed to store the pre-computed tables has a significant cost. Therefore, implementers must balance the benefit of faster operations with the extra cost of larger tables. The exact balance generally depends of the relative importance of speed versus memory usage, which can vary from one implementation to another.

Pre-computation can also be applied to the public key Q. Generally, the public key Q tends to vary more often than G: as it is different for each correspondent, whereas G is always fixed for a given system. Therefore the cost of one-time pre-computation for Q is amortized over a smaller number of repeated run-time computations involving Q. Nevertheless, if Q is to be used more than once, some net savings on time will be achieved. Public keys that are heavily used include those of certification authorities (CA), especially root, trusted or anchor CA public keys (that are pre-installed into a system). Therefore, pre-computation may be worthwhile for CA elliptic curve public keys where, for example, the protocol requires verification of a CA's certificate. Another difference between pre-computations of Q versus G is the cost of storing or communicating the pre-computed tables. Each public key Q requires its own pre-computed table. In a system with many distinct public keys, these costs may accumulate to the point that any benefit of faster computation is offset by the need to store or communicate keys. The net benefit depends on the relative cost of time, memory and bandwidth, which can vary tremendously between implementations and systems. Again, in the case of CA public keys, especially root, trusted or anchor CA keys, these keys tend to be fewer in number than end-entity public keys, so that the cost of pre-computation will generally be less and amortised over more operations.

Tables of multiples of points are not merely useful during pre-computation. In practice, such tables are commonly generated at run-time, during an initial phase of each computation. The savings provided by these tables is essentially that of avoiding certain repetitious operations that occur within a single computation. A single computation has less internal repetitions than two distinct computations have in common, so that saved repetition amount to less than pre-computation. Nevertheless, it has been found that with a judicious choice of table, the time need for a single computation can be reduced. The table takes time to compute, and computation of the table cannot be amortized over multiple computations, so is incurred for every computation. Experience has shown that particular tables decrease the amount of time needed because computing the table takes less time than the repetition operations that would have otherwise been needed. Usually, there is an optimum size and choice of table. Another cost of such tables is the memory needed to temporarily store the table. The cost of such memory may affect the optimal choice of table. Windowing methods are examples of such tables computed on the fly.

Not withstanding all of the above known techniques for efficient implementation, further efficiency improvements are desirable. In particular, the efficiency of verifying of ECDSA signatures is particularly desirable. Extensive pre-computation allows ECDSA signatures to be generated very quickly. In fact, ECDSA signature generation is one of the fastest digital signature generation algorithms known. On the other hand, ECDSA signature verification is relatively slower, and there are other signature algorithms have similar verification times to ECDSA. Improvement of ECDSA verification time is therefore important, especially for environments where verification time is a bottleneck.

In general, there is a need to enhance the efficiency of performing a computation to verify that a value corresponds to the sum of two of the values. It is therefore an object of the present invention to obviate or mitigate the above disadvantages.

SUMMARY OF THE INVENTION

In general terms the present invention provides a method and apparatus for verifying the equality of a relationship between the sum of scalar multiples of a pair of points on an elliptic curve and a third point on said curve. The method comprises the steps of i) obtaining a pair of integers of bit length less than one of said scalars and whose ratio corresponds to said scalar; ii) substituting said integers for said scalars in said relationship to obtain an equivalent relationship in which at least one of said terms is a scalar multiple of one of said points with reduced bit length, and iii) computing said equivalent relationship to verify said equality.

The method may be used for verifying that a value representative of a point R on an elliptic curve corresponds to the sum of two other points, uG and vQ. Integers w and z are determined such that the bit lengths of the bit strings representing w and z are each less than the bit length of the bit string of the integer v, and such that v=w/z mod n. With such w and z, the equation R=uG+vQ can be verified as âˆ’zR+(zu mod n)G+wQ=O.

Preferably, the bit lengths of w and z are each about half the bit length of n, which means that both w and z are both no larger than about n^1/2

The point âˆ’zR+(zu mod n)G+wQ can be computed efficiently because z and w are relatively small integers, and various of the methods for computing a sum faster than its parts can be used. The multiple (zu mod n) is full size, but within the context of an algorithm such as the ECDSA, the point G may be fixed or recurring. In this case the computation can be accelerated with the use of a stored table for G. Estimates of the times savings for this approach compared to conventional verification with tables for G are around 40%.

The values w and z may be obtained by using a partial completed extended Euclidean algorithm computation. Alternatively, a continued fractions approach may be utilised to obtain w and z efficiently.

In a further aspect of the invention there is provided a method of verifying a digital signature of a message performed by a cryptographic operation in a group of a finite field having elements represented by bit strings of defined maximum bit length. The signature comprises a pair of components, one of which is derived from an ephemeral public key of a signer and the other of which combines the message, the first component and the ephemeral public key and a long term public key of the signer. The method comprises the steps of recovering the ephemeral public key from the first component, establishing a verification equality as a combination of group operations on the ephemeral public key, the long term public key and a generator of the group with at least one of the group operations involving an operand represented by bit strings having a reduced bit length less than the defined maximum bit length, computing the combination and accepting the signature if said equality holds and rejecting the signature if said equality fails.

Preferably, the group is a elliptic curve group. As a further aspect, a method of generating a signature of a message by a cryptographic operation in an elliptic curve group of finite field comprising the steps of generating a pair of signature components with one of said components derived from a point representing an ephemeral public key and including in said signature an indicator to identify one of a plurality of possible values of said public key that may be recovered from said one component.

Embodiments of the invention will now be described by way of example only with reference to the accompanying drawings in which:â€”

FIG. 1 is a schematic representation of a data communication system,

FIG. 2 is a flow chart illustrating the steps in performing a signature for an ECDSA signature scheme.

FIG. 3 is a flow chart showing the verification of a ECDSA signature.

FIG. 4 is a flow chart showing the verification of an ECDSA signature using a precomputed value.

FIG. 5 is a flow chart showing the verification of an ECDSA signature using a table of precomputed values.

FIG. 6 is a flow chart showing the verification of an ECDSA signature using a precomputed value provided by the signer

FIG. 7 is a flow chart showing steps taken by a verifier upon failing to verify.

FIG. 8 is a flow chart showing steps taken by a signor to simplify verification.

FIG. 9 is a flow chart showing an alternative signature protocol to simplify verification

FIG. 10 is a flow chart showing an alternative technique performed by the signor to simply verification.

FIG. 11 is a flow chart showing an alternative verification ECDSA.

FIG. 12 is a flow chart showing point verification.

FIG. 13 is a flow chart showing a modified PVS verification protocol.

FIG. 14 shows a method of recovering a public key from an ECDSA signature.

The present invention is exemplified by reference to verification of digital signatures, in particular those signatures generated using ECDSA. It will be apparent however that the techniques described are applicable to other algorithms in which verification of a pair of values representative of points on an elliptic curve is required to groups other than elliptic curve groups. Therefore the accompanying description of the embodiments shown is exemplary and not exhaustive.

Referring therefore to FIG. 1, a data communication system 10 includes a pair of correspondents 12, 14 interconnected by a transmission line 16. The correspondents 12, 14 each include cryptographic modules 20, 22 respectively that are operable to implement one of a number of cryptographic functions. The modules 20, 22 are each controlled by CPU's incorporated in the correspondents 12, 14 and interfacing between input devices, such as a keyboard 24, a display device 26, such as a screen and a memory 28. Each cryptographic module includes internal processing capability including a random number generator 30 and an arithmetic processor 32 for performing elliptic curve computations such as point addition. It will be appreciated that the correspondents 12, 14 may be general purpose computers connected in a network or specialised devices such as cell phones, pagers, PDA's or the like. The communication link 16 may be a land line or wireless or a combination thereof. Similarly the cryptographic modules 20, 22 may be implemented as separate modules or incorporated as an application within the CPU.

In the present example, the correspondent 12 prepares a message M which it wishes to sign and send to the correspondent 14 using an elliptic curve cryptosystem embodied within the modules 20, 22. The parameters of the system are known to each party including the field over which the curve is defined (in the present example Fp where p is a prime), the underlying curve, E, the generator point G that generates the elements that form the group in which crypto operations are performed and therefore defines the order, n, of the group, and a secure hash function H, generally one of the Secure Hash Algorithms (such as SHA-1 or SHA-256) defined in Federal Information Processing Standard (FIPS) 180-2. Each element is represented as a bit string having a maximum bit length sufficient to represent each element in the group.

The steps taken to sign the message are shown in FIG. 2. Initially therefore the correspondent generates an integer k by the random number generator 30 and utilises the arithmetic unit 32 to compute a point R=kG that has co-ordinates (x, y). The correspondent 12 converts the co-ordinate x to an integer xâ€² and computes r=xâ€² mod n, which is the first component of the signature. The correspondent 12 also computes the integer e=H(M) mod n, where H is the secure hash function. Finally, the second component s is computed as s=(e+dr)/k mod n.

In addition to the components r and s, the signature includes information i to permit the co-ordinates representing the point R to be recovered from the component r. This information may be embedded in the message M, or forwarded as a separate component with r and s and will be used by the verifier to compute the value R. If the elliptic curve is defined over a field F of prime order p, and the elliptic curve E is cyclic or prime order n, then i can generally be taken as y mod 2, i.e., a zero or one. The indication i is required during recovery R, where the verifier sets x=r. It is very likely that x=r because n and p are extremely close for typical implementations. Given x, there are exactly two values y such that (x, y) is on the curve, and these two values y and yâ€² have different values mod 2. Thus i is just a single bit whose value indicates which of the y's is to be used, and adds relatively little cost to the signature.

Once the message is signed it is forwarded together with the components r,s, and i across the link 16 to the recipient correspondent 14. To verify the signature the steps set out in FIG. 3 are performed. First the correspondent 14 computes an integer e=H(M) mod n. Then the correspondent utilises the arithmetic unit 32 to compute a pair of integers u and v such that u=e/s mod n and v=r/s mod n.

The correspondent 14 also computes a pair of integers w and z using an iterative algorithm such that the maximum bit lengths of w and z are each less than the maximum bit length of the elements of the group, and such that v=w/z mod n. The bit lengths of w and z are preferably about one half the bit length of the elements. Such w and z can be found conveniently with the extended Euclidean algorithm and stopping at an appropriate point, typically half-way where w and v are half the bit length of the elements. Such an algorithm is exemplified, for example as Algorithm 3.74 in Guide to Elliptic Curve Cryptography by Henkerson, Menezes and Vanstone published by Springer under ISBN 0-387-95273, which represents a quantity k as k=k₁+k₂Î» mod n, where the bit lengths of k₁and k₂are about half the length of n. This equation can be re-written as Î»=(kâˆ’k₁)/k₂mod n. By setting k=1 and Î»=v, then the above referenced Algorithm 3.74 can be used to obtain n established for the system, k set to 1 and the value for v used as the variable input. The output obtained k₁k₂can then be used to compute w=1âˆ’k₁and k₂used as w=1âˆ’k₁and z=k₂.

Thus, the arithmetic unit 32 is used to implement the following pseudo-code to obtain the values of w and z.

Let r0=n and t0=0.

Let r1=v and t1=1.

For i>1, determine ri, ti as follows:

Use the division algorithm to write r_(iâˆ’1)=qi r_(iâˆ’2)+ri, which defines ri.

Let ti=t_(iâˆ’1)+qi t_(iâˆ’2).

Stop as soon as ri<sqrt(n)=n^(Â½), or some other desired size.

Set w=ri and z=ti. Note that ri=ti v mod n, so w=z v mod n, so v=w/z mod n, and both w and z have about half the bit length of n, as desired.

The correspondent 14 also recovers a value corresponding to the point R utilising the information i. In its simplest form this is obtained by substituting the value of r received in the curve and determining which of the two possible values of y correspond to the sign indicated by the bit i.

With the value of R recovered, the verification of the ECDSA, namely that R=uG+vQ, may proceed with a revised verification by confirming that the verification equality âˆ’zR+(zu mod n)G+wQ=0. The verification equality âˆ’zR+(zu mod n)G+wQ involves a combination of group operations on each of the ephemeral public key R, generator G and long-term public key Q and can be computed efficiently because z and w are relatively small integers. As will be described below, various of the methods for computing a sum faster than its parts can be used. The multiple (zu mod n) is full size, but within the context of a system such as the ECDSA in which the points have varying longevity, the point G may be considered fixed or recurring. In this case the computation can be accelerated with a precomputed table for G, which may be stored in the memory 28 and accessed by arithmetic unit 32 as needed. The representations of the points âˆ’zR and wQ which cannot effectively be precomputed have smaller bit lengths and therefore less time consuming computation. Assuming the computation returns a value O, the signature is assumed to be verified.

A number of different known techniques may be utilised to compute the required relationship, each of which may be implemented using the arithmetic processor 32. Each offers different advantages, either in speed or computing resources, and so the technique or combination of techniques will depend to a certain extent on the environment in which the communication system is operating. For the sake of comparison, it will be assumed that u and v are integers of bit length t. Computing uG and vQ separately requires about 3t/2 point operations, assuming no pre-computation, for a total of about 3t point operations. Computing uG+vQ, which is the verification normally used for ECDSA, require t doublings, some of which can be simultaneous. Each of u and v are expected to have about t/2 bits set to one in their binary representation. In basic binary scalar multiplication, each bit of one requires another addition. (In more advanced scalar multiplication, signed binary expansion are used, and the average number of additions is t/3.) The total number of point operations is therefore t+(2(t/2))=2t on average as simultaneous doubling has saved t doublings.)

The revised verification instead uses a computation of a combination of the form aG+wQ+zR, where a is an integer of bit length t representative of the value zu mod n and w and z are integers of bit length about (t/2). Organising the verification computation in this way permits a number of efficient techniques to be used to reduce the number of point operations. An efficient way to compute this is to use a simultaneous doubling and add algorithm. For example, if the relationship 15G+20Q+13R is to be computed it can be done in stages as 2Q; G+2Q; G+2Q+R; 2G+4Q+2R; 3G+4Q+2R; 3G+5Q+2R; 3G+5Q+3R; 6G+10Q+6R; 7G+10Q+6R; 14G+20Q+12R; 15G+20Q+13R, for a total of 12 point additions, which is fewer than the method of generic scalar multiplication for each term separately. The main way that this method uses less operations is when it does simultaneous doubling, in steps as going from G+2Q+R to 2G+4Q+2R. In computing each term separately three operations would be used corresponding to this one operation. In fact, three simultaneous doubling were used, each saving two operations, so simultaneous doubling account precisely for all the savings. The number of doublings to compute the combination is governed by the length of the highest multiple, so it is t. The number of additions for a is (t/2), on average, and for Q and R it is (t/4) each on average. The total, on average, is t+(t/2)+(t/4)+(t/4)=2t. The algorithm is further exemplified as Algorithm 3.48 of the Guide to Elliptic Curve Cryptography detailed above.

Although there does not appear to be any savings over the previous method, which also took 2t point operations, advantage can be taken of the fact that in practice, for ECDSA, the generator G is constant. This allows the point J=2^m G to be computed in advance, and stored in memory 28 for future use. If m is chosen to be approximately t/2, then aâ‰¡aâ€²+aâ€³ 2^m, where aâ€² and aâ€³ are integers of bit length about (t/2). Accordingly, aG+wQ+zR can be written as aâ€²G+aâ€³J+wQ+zR. In this form, all the scalar multiples have bit length (t/2). The total number of doublings is thus (t/2). Each of the four terms contributes on average (t/4) additions. The total number of point operations, on average, is the t/2+4 (t/4)=3t/2.

Accordingly, to verify the signature r,s, as shown schematically in FIG. 4, the recipient computes w, and z as described above, determines the value of aâ€² and aâ€³ and performs a double and add computation to obtain the value of the verification representation. If this corresponds to the group identity, the verification is confirmed.

With the conventional verification equation approach of computing uG+vQ, the multiple v will generally be full length t, so the pre-computed multiple J of G will not help reduce the number of simultaneous doublings.

Therefore, by pre-computing and storing the single point J, verifying using the relationship âˆ’zR+(zu mod n)G+wQ=O allows an ECDSA signature to be verified in 25% less time. In other words, 33% more signatures can be verified in a given amount of time using the embodiment described above.

Alternatively, many implementations have sufficient memory 32 to pre-compute and store essentially all power of two multiples of G, essentially making it unnecessary to apply doubling operations to G. In such situations uG+vQ can be computed with t doublings of Q and (t/2) additions for each of G and Q. The total is still 2t operations. However, as shown in FIG. 5, the value of aG can be retrieved from the precomputed table stored in memory 32 so that computing aG+wQ+zR, can be attained with (t/2) doublings for the wQ and zR, no doublings for G, t/2 additions for G, and t/4 additions for each of Q and R. The total is 3t/2 operations. The savings are the same as described with FIG. 4, when only one multiple of G was pre-computed and stored.

When signed binary expansions are used, then computing uG+vQ (without any pre-computation) requires about t doublings and (t/3) additions for each of G and Q, for a total of (10/6)t operations, on average. When signed binary expansions are used to find aâ€²G+aâ€³J+wQ+zR, about t/2 doublings are needed, and (t/6) additions for each of G, J, Q and R, for a total of (7/6)t operations, on average. The time to verify using the verification representation described above is 70% compared to without, or 30% less. This allows about 42% more signatures to verified in a given amount of time. The advantage of verifying using the revised verification representation is increased when combined with a more advanced technique of scalar multiplication referred to as signed binary expansions. This technique is very commonly used today in elliptic curve cryptography, so today's existing implementations stand to benefit from adoption of the verification representations.

Accordingly, it will be seen that by reorganizing the verification equation so that signature variables have a reduced bit length, the speed of verification may be increased significantly.

In the above embodiments, the recipient performs computations on the components r,s. To further accelerate signature verification as shown in FIG. 6, a signer may provide a pre-computed multiple of the public key Q to the verifier. The verifier can use the pre-computed multiple to further accelerate verification with Q. In this embodiment the verifier determines an equivalent equation to the ECDSA verification equation in the form aR+bG+cQ=O, where a is approximately n^1/3and represents âˆ’z, b is approximately n and represents âˆ’zu mod n, and c is approximately n^2/3and represents w. This can be done using the extended Euclidean algorithm as described above and stopping when the bit length of w is twice that of z. Again, therefore, the signor signs the message M and generates the signature components r,s. It also includes the identifier i in the message forwarded to the verifier. The signor pre-computes a multiple Î²Q where the scalar multiple Î² is a power of two nearest to n^1/3and forwards it with the signature.

Upon receipt, the verifier computes w and z. The verifier then determines c=câ€²+câ€³Î² and b=bâ€²+bâ€³Î²+bâ€²â€³Î²^2. In addition, since G is a fixed parameter, the verifier has pre-computed multiples of G of the form Î²G and Î²^2G. If n is approximately 2^t, then the verifier needs just t/3 simultaneous doubles to compute aR+bG+cQ. The verification can proceed on the basis aR+(bâ€²+bâ€³Î²+bâ€²â€³Î²^2)G+(câ€²+câ€³Î²)Q=0. The precomputed values for G and Q can then be used and the verification performed. The verifier will need 2t/3 point additions, assuming that signed NAF is used to represent a, b and c. The total number of point operations is thus t, which represents a further significant savings compared to 3t/2 with the present invention and without the pre-computed multiple of Q such as described in FIG. 4 and compared to 2t using the conventional representations and without any pre-computed multiple of Q.

Given a pre-computed multiple of both Q and G, then uG+vQ can be computed with (t/2)+4(t/4)=3t/2 point operations using conventional representations. When pre-computed multiples of Q are feasible, then the signing equation, in the form above, again provide a significant benefit. The analyses above would be slightly modified when signed binary expansions are used.

With yet other known advanced techniques for computing linear combinations of points, some of which are discussed below, the use of the relationship allows signature verification to take up to 40% less time.

When implementing scalar multiplication and combinations, it is common to build a table at run-time of certain multiples. These tables allow signed bits in the representation of scalar multiple to be processed in groups, usually called windows. The table costs time and memory to build, but then accelerates the rest of the computation. Normally, the size of the table and associated window are optimized for overall performance, which usually means to minimize the time taken, except on some hardware implementation where memory is more critical. A full description and implementing algorithms for such techniques is to be found in Guide to Elliptic Curve Cryptography, referenced above at pages 98 et. seq.

Such run-time tables, or windowing techniques, for scalar multiplication techniques can be combined with the revised verification equation in the embodiments described above. When using such tables, the savings are approximately the same as outlined above. The reason the savings are similar is the following simple fact. Tables reduce the number of adds, by pre-computing certain patterns of additions that are likely occur repeatedly, whereas the use of the revised verification relationship reduces the number of doubles by providing for more simultaneous doubling. In fact, when using tables, the number of adds is reduced, so the further reduction of the doubles provided by using the revised verification relationship has even more impact.

By way of an example, a common approach to tables, is to use a signed NAF window of size 5. Building a table for such a NAF requires 11 adds. In the example above where the signer sends a pre-computed multiple uQ of Q, the verifier can build tables for R, Q and uQ, at a cost of 33 adds. It is presumed that verifier already has the necessary tables built for G. Using the pre-computed doubles, the verifier only needs t/6 simultaneous additions for verification. These savings improve as the key size increases. For the largest key size in use today, the savings are in the order of 40%. Such tables do of course require the necessary memory 32 and so selection of the appropriate techniques is governed by the hardware available.

Similarly, computation techniques known as joint sparse forms could be used for computational efficiency.

As described above, the integers w, z were found using the extended Euclidean algorithm. Alternative iterative algorithms may be used, including the continued fractions approach. In the continued fractions approach, which is essentially equivalent to the extended Euclidean algorithm, one finds a partial convergent Î³/Î´ to the fraction v/n, such that Î´ is approximately n^1/2. A property of the partial convergent is that |Î³/Î´âˆ’v/n|<1/Î´^2. Multiplying this inequality by Î´n gives |Î³nâˆ’vÎ´|<n/Î´, which is approximately n^1/2. Now set z=Î´ and w=Î³nâˆ’vÎ´. It is easy to check that v=w/z mod n, and note that w and z have the desired size.

As noted above, a conventional ECDSA signature, does not include the point R but instead, it includes an integer xâ€² obtained from r=x mod n, where R=(x, y). The verifier therefore needs to recover R.

The method to recover R discussed above is to supplement the signature (r, s) with additional information i. This information can be embedded in the message, for example. The verifier can use r and i to compute R. When p>n, there is a negligible chance that xâ€²>n and consequently r=xâˆ’n. If however such a case does occur, the verification attempt will fail. Such a negligible failure rate for valid signatures can be accepted, or dealt with in the following manner.

As shown in FIG. 7, upon failure of the verification, at the verifier's expense the verifier can try x=r+n, and repeat the verification for another value of R, which will succeed in this particular case. Continued failure to verify will lead to rejection of the signature. Alternatively, as shown in FIG. 8 the signer can detect when x>n, which should happen negligibly often, and when this happens generate a different k and R. In either of the approaches, the problem arises so rarely that there is negligible impact on performance.

Other techniques for determining R can be utilized. In non-cyclic curves, there is a cofactor h, which is usually 2 or 4 in practice. This can lead to multiple possible values of x. The probability that r=x is approximately 1/h. In other situations, we will generally have r=xâˆ’n (if h=2), or more generally r=xâˆ’mn where (m is between 0 and hâˆ’1). Because p is approximately hn, then except in a negligible portion of cases there will be h possible values of x that are associated with r. To make recovery of x, and hence R easier, the signer can compute m and send it to the verifier within the message or as a further signature component. Alternatively, the verifier can make an educated guess for m. This can be illustrated in the case of h=2.

Corresponding to r is a correct x and a false value x_f. The false value x_fhas an approximately Â½ chance of not corresponding to a value of the x-coordinate on E, and a further 1/h chance of not corresponding to a multiple of G. If one of the two values for x is invalid, either by not being on E or if it is not having order n, both of which can be efficiently checked, then that value can be eliminated. Thus at least Â¾ of the time, the verifier will easily find the correct x. The remaining Â¼ of the time at maximum, the verifier will not know which of the two x-values to try. If the verifier can guess one of the x values to verify, half the time, this guess will be right and the signature will verify, and the other half of the time, the first signature attempt will fail and the verifier must try the other x value. Therefore the probability that the verifier must verify two signatures is â…›. Despite this probability of two verifications, the average verification is still improved. This can still provide the verifier time savings on average. If an accelerated verification takes 70% as long as a normal verify, but 12.5% of the verifies require twice as long as an accelerated verify, then the average time is 79% of a normal verify. Furthermore, as outlined further below, the signer can assist by providing m for the verifier or by doing the extra work of trying both values to ensure that only one m is valid.

A similar method may be utilized with a cofactor h=4. In fact, a higher value of h reduces the probability of each of the potential x values from being valid. There are more potential x values, but the analysis shows a similar benefit to the verifier. There are three false values of x, and each has a probability of â…› of appearing valid with a fast check. The chance that no false values appear to be a valid x with a fast check is thus (â…ž)³which is about 77%. Most of the remaining 23% of the time, just one of the false x values will appear valid and potentially require a full signature verification.

The inclusion of i (and of m if necessary) is quite similar to replacing r by a compressed version of R consisting of the x coordinate and the first hit of the y coordinate. This alternative, of sending a compressed value of R instead of r, has the advantage of being somewhat simpler and not even a negligible chance of false recovery. Accordingly, as shown in FIG. 9, the signature is computed to provide a pair of components, râ€²,s and forwarded with the message M to the recipient 14. The component râ€² is composed of the x co-ordinate of the point R and the first bit of the y co-ordinate. The component s is computed as before.

To verify the signature, the recipient 14 recovers the point R directly from the component râ€² and uses the verification equality equation âˆ’zR+(zu mod n)G+wQ=O to confirm it corresponds to the group identity. The transmission of the modified co-ordinate râ€² simplifies the verification but does increase the bandwidth required.

In some situations, no channel may be available for the signer to send extra bits. For example, existing standards may strictly limit both the signature format and the message format leaving no room for the sender to provide additional information. Signers and verifiers can nevertheless coordinate their implementations so that R is recoverable from r. This can be arranged by the signer, as shown in FIG. 10, by ensuring that the value of x conforms to prearranged criteria. In the notation above, the signer will compute R=kG=(x, y) as normal, and then in notation above compute i=y mod 2. If i=1, the signer will change k to âˆ’k mod n, so that R changes to âˆ’R=(x, âˆ’y) and i changes to 0. When the verifier receives the signature, the verifier presumes that i=0, and thus recovers the signature. The value of i is thus conveyed implicitly as the value 0, and the signer has almost negligible cost for arranging this. Similarly, in non-cyclic elliptic curves, the signer may try to transmit m implicitly, which to some extent has already been described. In the case of h=2, recall that the Â¼ of the time, the verifier may need to verify two signatures. Instead of the verifier doing this extra work, the signer can detect this Â¼ case, and try another value for k and R instead, repeating the process until one is found that conforms to the criteria. The verifier can determine which value of x to use without verifying two signatures.

As an alternative to modifying R as described above, and to maintain strict conformity to the ECDSA standard, the value of s may be modified after computation rather than R. In this case, the signer notes that the value of R does not conform to the prearranged criteria and proceeds to generate r and s as usual. After s is computed, the value is changed to (âˆ’s) to ensure the verification will be attained with the presumption of the prearranged value of y.

When a signer chooses a signature (r, s) such that R is implicitly recovered, an ordinary verifier will accept the signature as usual. Such signatures are perfectly valid. In other words, the revised verification is perfectly compatible with existing implementations of ECDSA verification. An accelerated verifier expecting an implicitly efficient signature but receiving a normally generated signature, will need to try two different values of i. If accelerated verification takes 60% of the time of a normal verify, then in a cyclic curve (cofactor h=1), the average time to needed verify a normal signature is 50% (60%)+50% (120%)=90% of a normal verify. This because 50% of the time a normal signature will have i=0, requiring just one implicitly accelerated verify, and the other 50% of the time, two accelerated verifies are needed. Thus an implicitly accelerated verify will still be faster than a normal verifier, even when the signatures are not implicitly accelerated.

Conventional signatures may also be modified, either by the signer or by a third party, to permit fast verification. In this case the signature is forwarded by a requestor to a third party who verifies the signature using the verification equality. In so doing the value of R is recovered. The signature is modified to include the indicator I and returned to the requestor. The modified signature may then be used in subsequent exchanges with recipients expecting fast verify signatures.

The above techniques recover R to permit a revised verification using the relationship âˆ’zR+(zu mod n)G+wQ=O. However, where the ECDSA is being verified, the integers w and z may be used without recovery of R as shown in FIG. 11. It is possible to compute the x coordinate of zR and the xâ€² coordinate of the point wQ+(zu mod n)G, and then check the equality of these two x-coordinates. Only the x-coordinate of the point zR can be computed, as it is not possible to compute the y-coordinate zR directly without knowing the y-coordinate of R. However, there are several known methods to compute the x-coordinate of zR from the x-coordinate of R without needing the y coordinate of R. Such techniques include Montgomery's method set out on page 102 of the Guide to Elliptic Curve Cryptography identified above. It is then sufficient to check the x-coordinates of zR and wQ+(zu mod n)G, because equality of the x-coordinates means that wQ+(zu mod n)G equal zR or âˆ’zR, which means w/z Q+u G equals R or âˆ’R, which means uG+vQ has the same x-coordinate as R. This is the condition for successful ECDSA validation. One recovers the x-coordinate of R from the signature component r using the methods discussed above. The advantage of this approach is that it does not require extra work to recover the y-coordinate. A disadvantage, compared to the previous methods above, is that the zR has to be computed separately from wQ+(zu mod n) G meaning that some of the savings of the joint sum are not achieved.

The above examples have verified a signature between a pair of correspondents 12, 14. The technique may also be used to verify an elliptic curve key pair (d, Q) as shown in FIG. 12. To verify the key pair means to check that Q=dG. This may be important when the key pair is provided by a third party under secure conditions to ensure no tampering has occurred. If t is the bit length of d, then computing dG with the binary method take (3t/2) operations on average. In the present embodiment, one of the correspondents, 12, 14 generates a random integer d and obtains a pair of integers w, z such that d=w/z mod n. Typically the integers w, z are each of half the of length d. Then the correspondent computes zQâˆ’wG, and checks that the result is the group identify 0. Computing zQâˆ’wG takes t operations on average so a saving of 50% is obtained. This has the most advantage in environments where storing a pre-computed multiple of G is too expensive. As an alternative where limited memory is available, given a pre-computed multiple H=uG, then dG can be computed as dâ€² G+dâ€³H, where d=dâ€²+dâ€³u mod n, with roughly the same cost as above.

Another application is implicit certificate verification. Implicit certificates are pairs (P, I), where P is an elliptic curve point and I is some identity string. An entity Bob obtains an implicit certificate from a CA by sending a request value R which is an elliptic curve point to the CA. The CA returns the implicit certificate (P, I) and in addition a private key reconstruction data value s. Bob can use s to calculate his private key. More generally, any entity can use s to verify that the implicit certificate correctly corresponds to Bob's request value R and the CA public key C. This is done by checking the verification equality H(P, I)R+sG=H(P,I) P+C, where H is a hash function. This equation is equivalent to eQ+sG=C, where e=H(P, I) and Q=Râˆ’P. The form of this equation is highly similar to the form of the standard ECDSA verification equation. Consequently, the techniques discussed above may be used to provide a means to accelerate verification of this equation. This is done optimally by determining relatively smaller values w and z such that e=w/z mod n, then multiplying the equation through by z to give: wQ+(sz mod n)Gâˆ’zC=O. Again, the multiple of G is this equation is full size, but generally multiples of G can be pre-computed, so this does not represent a problem.

Another variant that takes advantage of this technique is to shorten all three multiples in the ECDSA signing equation. Theoretically, each multiple can be shortened to a length which is â…” the length of n (where n is the order of G). One way to achieve this shortening is by solving the short vector lattice problem in 3 dimensions. Algorithms exist for solving such problems. Shortening all three multiples is most useful when no pre-computed multiples of G can be stored, which makes it more efficient to reduce the length of the multiple of G as much as possible. Such techniques are described more fully in Henri Cohen, â€œA Course in Computational Algebraic Number Theoryâ€ , Springer, ISBN 0-387-55640-0. Sections 2.6 and 2.6 describe the LLL algorithm, its application to finding short vectors in lattices, and also mentions Vallee's special algorithm for 3 dimensional lattices.

Another application of this technique is the application to a modified version of the Pintsov-Vanstone Signature scheme (PVS) with partial message recovery. A PVS signature is of a triple (r, s, t). Verification of a signature and message recovery from a signature under public Q, with base generator G, is done as follows. The verifier computes e=H(râˆ¥t), where H is a hash function. The verifier then computes R=sG+eQ. Next, the verifier derives a symmetric encryption key K from R. With this, the verifier decrypts r using K to obtain a recovered message part u. The recovered message is some combination of t and u. The signature is valid only if u contains some redundancy, which is checked by verifying that u conforms to some pre-determined format. The PVS scheme is part of draft standards IEEE P1363a and ANSI X9.92.

In a modified variant of PVS, verification time can be decreased by utilizing integers w and z. The modified variant of PVS is shown in FIG. 13 and proceeds as follows. After computing e as usual, the verifier then finds w and z are length half that of n such that e=w/z mod n, where n is the order of the point G. The verifier then computes R=(zs mod n) G+wQ, and proceeds as before, so deriving a key from R and then decrypting r with the key, and then verifying that the decryption has the correct form. This form of verification is more efficient because the multiple of Q is smaller.

A method to further accelerate signature verification of digital signature, in elliptic curve groups and similar groups is illustrated as follows. The verification of an ECDSA signature is essentially equivalent to confirmation that a linear combination, such as aR+bQ+cG, of three elliptic curve points, equals the point of infinity. One way to verify this condition is to compute the point aR+bQ+cG and then check if the result is the point O at infinity, which is the identity element of the group as described above. This verification can sometimes be done more quickly than by directly computing the entire sum. For example, if a=b=c, then aR+bQ+cG=O if and only if the points R, Q and G are collinear. Checking if points are collinear is considerably faster than adding to elliptic curve points. Collinearity can be checked with just two field multiplication, by the equation (x_Râˆ’x_G)(y_Qâˆ’y_G)âˆ’(x_Qâˆ’x_G)(y_Râˆ’y_G)=0. Adding points requires at least two field multiplication, a field squaring and a field inversion, which is generally equivalent to about 8 field multiplication. When a=b=c, verification is thus possible in about 18% of the time taken by adding the points. As such, this technique may be used as a preliminary step of the verification process where the likelihood of these conditions existing is present.

Similarly, when b=c=0, so that one wishes to verify that aR=O, in principle one does not need to compute aR in its entirety. Instead one could evaluate the a^thdivision polynomial at the point R. The division polynomial essentially corresponds to a recursive formula for the denominators of coordinates the point aR, when expressed as rational functions of the coordinates of the point R. It is known that aR=O if and only if the denominator is zero. Furthermore, when b=c=0 and the elliptic curve group is cyclic of prime order n, it is known that aR=O only if a=0 mod n or if R=O. This verification is comparably instantaneous, in that zero elliptic curve point operations are needed. When the cofactor is small, such as h=2 or h=4, point operations can replaced by a few very fast field operations. Thus special cases of verification that a sum points is zero can be done very quickly.

Recursive formula exist, similar to the recursive formulae for division polynomials, for the denominators of sums like aR+bQ+cG, and these can be compute more quickly than the computing the full value of the point aR+bQ+cG. Knowledge of the group order n can further improve verification time.

Yet another application of this technique is to provide efficient recovery of the public key Q from only the ECDSA digital signature as shown in FIG. 14. Suppose that one correspondent 12 signs a message M with signature (r, s) and wishes to send the signed message to the correspondent 14. Normally correspondent 14 will send M and (r, s) to the correspondent, and will also often send the public key Q. If correspondent 12 did not send her public key, then normally correspondent 14 will look up her public key up in some database, which could stored locally or remotely via some network. To avoid this, it would be beneficial to be able to recover the public key Q from the signature.

Given an ordinary ECDSA signature (r, s), one can recover several candidate points Q that could potentially be the public key. The first step is recover the point R. Several methods have already been described for finding R in the context of accelerated verification, such as: by inclusion of extra information with the signature; by inclusion of extra information in the message signed; by extra work on the signer's part to ensure one valid R can correspond to r; and by extra work on the verifier's part of trying a multiplicity of different R values corresponding to r. Once R is recovered by one of these methods, then the public key Q can be recovered as follows. The standard ECDSA verification equation is R=(e/s)G+(r/s)Q, where e=H(M) is the hash of the message. Given R and this equation, solving for Q is done by Q=(s/r) Râˆ’(e/r) G.

However, since with a significant probability a pair (r, s) will yield some valid public key, the correspondent 14 needs a way to check that Q is correspondent's 12 public key. Correspondent 12 can make available to correspondent 14 the signature, such as another ECDSA signature (râ€², sâ€²), from a CA on correspondent 14 public key. Correspondent 12 can send the CA signature, (râ€², sâ€²), to correspondent 14, or correspondent 14 can look it up in some database. The CA's signature will be on correspondent's 12 name and her public key Q. Correspondent 14 will use the CA's certificate to verify the message which corresponds to the public key Q. If the signature verifies then the correspondent 14 has recovered the correct value for the public key Q. Omitting the public key from the certificate can save on bandwidth and storage and the verification process described above yields reduced verification times.

Correspondent 14 could also verify that Q is correspondent's 12 public key by checking Q against some more compact value derived from Q, such as the half of the bits of Q. The compact version of Q could then stored or communicated instead of Q, again savings on storage and bandwidth.

H will also be appreciated that each of the values used in the verification equality are public values. Accordingly, where limited computing power is available at the verifier it is possible for the signer to compute the values of w and z and forward them with R as part of the message. The recipient then does not need to recover R or compute w and z but can perform the verification with the information available. The verification is accelerated but the bandwidth increased.

Although the descriptions above were for elliptic curve groups, many of the methods described in the present invention applies more generally to any group used in cryptography, and furthermore to any other application that uses exponentiation of group elements. For example, the present invention may be used when the group is a genus 2 hyperelliptic curve, which have recently been proposed as an alternative to elliptic curve groups. The above techniques may also be used to accelerate the verification of the Digital Signature Algorithm (DSA), which is an analogue of the ECDSA. Like ECDSA, a DSA signature consists of a pair of integers (r, s), and r is obtained from an element R of the DSA group. The DSA group is defined to be a subgroup of the multiplicative group of finite field. Unlike ECDSA, however, recovery of R from r is not easy to achieve, even with the help of a few additional bits. Therefore, the present technique applies most easily to DSA if the value is R sent with as part of the signed message, or as additional part of the signature, or as a replacement for the value r. Typically, the integer r is represented with 20 bytes, but the value R is represented with 128 bytes. As a result, the combined signature and message length is about 108 bytes longer. This could be a small price to pay to accelerate verification by 33%, however.

In the DSA setup, p is a large prime, and q is smaller prime and q is a divisor of (pâˆ’1). An integer g is chosen such that g^q=1 mod p, and 1<g<p. (Note that q and g correspond to n and G, respectively, from ECDSA.)

The private key of the signer is some integer x and the public key is Y=g^x mod p.

The signer generates a signature in the form (R,s) instead of the usual (r, s). Here, R=g^k mod p, whereas, r=R mod q. In both cases, s=k^(âˆ’1) (h(M)+x r) mod q, where x is the private key of the signer, M is the message being signed, and h is the hash function being used to digest the message (as in ECDSA).

In normal DSA, the verifier verifies signature (r, s) by computing u=h(M)/s mod q and v=r/s mod q, much like the u and v in ECDSA embodiments, and then checks that r=(g^u Y^v mod p) mod q.

In this embodiment, the verifier finds w and z of bit length about half that of q, so that each of w and z is approximately sqrt(q), such that v=w/z mod q. This is done by the same method as in ECDSA embodiment above, with n replaced by q. The verifier then computes:
R^z g^(zu mod q)Y^w mod p.

If this quantity equals 1, then verifier accepts the signature, otherwise the signature is rejected.

The verifier computes this quantity using the square-and-multiply algorithm, or some variants thereof, and exploits simultaneous squaring, which is analogous to simultaneous doubling in ECDSA. Many of the methods of ECDSA fast verify may be used for DSA fast verify. A pre-computed multiple of the g, say j, may be used, so that the computation looks like: R^z g^s j^t Y^w mod p

where each of z, s, t and w has bit length about half that of q. If pre-computed powers of the public Y are made available, then the lengths of the exponents can be further reduced, thereby further reducing the number of doublings, making the verification yet faster.