ATBECHDEDKESFRGBGRITLILUNLSEMCPTIESILTLVFIRO..CY..TRBGCZEEHUPLSK....IS..............................
*
J
DIM360 Ver 2.40 (30 Jan 2013) - 2999001/0
1815635
CORRECTED EUROPEAN PATENT SPECIFICATION
B9
B1
20140115
W1
de
Ansprüche EN
en
Claims EN
fr
Revendications EN
EP
05801157.8
20051111
20070607
20120411
en
en
en
PCT/IB2004/003699
20041111
WO
626883 P
20041112
US
20140115
201403
20070808
200732
20130925
201339
20130416
20140115
201403
H04L 9/28 20060101AFI20060929BHEP
H04L 9/30 20060101ALI20060929BHEP
de
ANGEPASSTE STATISCHE DIFFIE-HELLMAN-GRUPPEN
en
CUSTOM STATIC DIFFIE-HELLMAN GROUPS
fr
GROUPES DE DIFFIE ET HELLMAN STATIQUES SUR DEMANDE
WO-A1-01/35573
US-A1- 2002 055 962
US-A1- 2003 028 771
US-B1- 6 252 959
US-B1- 6 446 205
US-B1- 6 778 666
"Chapter 4: Public-Key Parameters ED - Menezes A J; Van Oorschot P C; Vanstone S A", [Online] 1 October 1996 (1996-10-01), HANDBOOK OF APPLIED CRYPTOGRAPHY; [CRC PRESS SERIES ON DISCRETE MATHEMATICES AND ITS APPLICATIONS], CRC PRESS, BOCA RATON, FL, US, PAGE(S) 133 - 168, XP001525004, ISBN: 978-0-8493-8523-0 Retrieved from the Internet: URL:http://www.cacr.math.uwaterloo.ca/hac/ > * chapter 4.4, "Prime number generation"; page 145 - page 154 *
Seminumerical algorithms: section 4.5.4, "Factoring into Primes": In: D. Knuth: "The Art of Computer Programming", 1997, Addison Wesley, Reading, MA, USA, XP002633823, ISBN: 978-0-201-89684-8 vol. 2, pages 379-415, * Algorithm A; page 380 - page 385 *
David Chaum, Hans van Antwerpen: "Undeniable Signatures", Lecture Notes in Computer Science Advances in Cryptology - CRYPTO '89 Proceedings, vol. 435 1990, pages 212-216, XP002633824, DOI: 10.1007/0-387-34805-0_20 Retrieved from the Internet: URL:http://www.springerlink.com/content/rt txwq36m7454evd/ [retrieved on 2011-04-20]
BROWN D R L ET AL: "The Static Diffie-Hellman Problem", CERTICOM RESEARCH,, [Online] 23 June 2005 (2005-06-23), pages 1-17, XP002533452, Retrieved from the Internet: URL:http://eprint.iacr.org/2004/306.ps>
'Chapter 8: Public-Key Encryption ED - Menezes A J; Van Oorschot P C; Vanstone S A', [Online] 01 October 1996, XP001525008 ISBN: 978-0-8493-8523-0 HANDBOOK OF APPLIED CRYPTOGRAPHY; [CRC PRESS SERIES ON DISCRETE MATHEMATICES AND ITS APPLICATIONS], CRC PRESS SERIES ON DISCRETE MATHEMATICS AND ITS APPLICATIONS, BOCA RATON, FL, US, PAGE(S) 283 - 319 Retrieved from the Internet: <URL:http://www.cacr.math.uwaterloo.ca/hac/ >
20110510
BROWN, Daniel, R., L.
6033 Paddle Road
Mississauga, Ontario L5N 1X8
CA
GALLANT, Robert, P.
4788 Rosebush Road
Mississauga, Ontario L5M 5N1
CA
VANSTONE, Scott, A.
10140 Pineview Trail, P.O. Box 490
Campbellville, Ontario L0P 1B0
CA
Certicom Corp.
101263463
RSJ10711EP
4701 Tahoe Boulevard Tahoe A, 6th Floor
Mississauga, Ontario L4W 0B5
CA
Finnie, Peter John
et al
100038361
Gill Jennings & Every LLP The Broadgate Tower 20 Primrose Street
London EC2A 2ES
GB
AT
BE
BG
CH
CY
CZ
DE
DK
EE
ES
FI
FR
GB
GR
HU
IE
IS
IT
LI
LT
LU
LV
MC
NL
PL
PT
RO
SE
SI
SK
TR
IB2005003380
20051111
en
WO2006051402
20060518
200620
20070808
200732

FIELD OF THE INVENTION:
The present invention relates to static groups in the field of cryptography.

DESCRIPTION OF THE PRIOR ART
Public key cryptography, as introduced in 1975 by Diffie and Hellman, made possible, among other things, confidential communication without pre-shared secrets and digital signatures with non-repudiation properties.
The most ingenious aspect of the Diffie-Hellman (DH) protocol for public key cryptography was to use a mathematical structure called a group, in which a certain problem, the discrete logarithm problem, was intractable.
A group is merely a set of elements and a single operation that acts on any two elements. Familiar examples of groups include: the integers (including zero and negative integers) under the operation of addition, rational numbers under the operation of addition, and non-zero rational numbers under the operation of multiplication. These familiar examples are infinite groups, but there also exist finite (or discrete) groups. Cryptographers have generally been more interested in finite groups, partly because the group elements can be communicated with a fixed number of bits. Examples of finite groups are generally well known in the field.
The most familiar example is groups based on modular arithmetic. If p is prime number and t is any integer, then t mod p is the remainder of t divided by p. So if t = pq + r for some integer q, and r is between 0 and p -1 inclusive, then r = t mod p. The set of integers from 0 to p -1 inclusive form a group under the operation of modular addition, in which s and t are combined to become s + t mod p. This group is denoted by Z_p. More generally, p can be any integer.
The set of integers from 1 to p - 1 inclusive, forms another group under the operation of modular multiplication, in which s and t are combined to become st mod p. This group is denoted Z_p*, is often called a mod p group. More generally, p can be any power of a prime with a slightly different operation. When writing the operation for these groups, the notation mod p is often omitted if it is clear from context.
A subgroup of a group G is a group that is also a subset of the elements in G and has the same operation as G. The group Z_p*, for example, has a subgroup of order 2 whose elements are 1 and p - 1. More generally, for any element g of a group, there is a smallest subgroup, denoted <g>, containing <g> elements. It is known that <g> is given precisely by the set of elements g^x for integers x, where g^x means the product of x copies of g. In groups with additive notation, such as Z_p, the power g^x is instead written as xg. The element g is a generator for <g>. A group is cyclic if it has a generator, so <g> is cyclic by nature. The groups Z_p and Z_p* are also cyclic, but in general, groups do not have to be cyclic.
The order of the group is the number of elements. The group Z_p has order p and the group Z_p* has order p - 1. The order of an element g is the order of the subgroup <g>. It will be assumed that g has order n.
In groups where the operation is written as multiplication, the discrete logarithm problem may be stated as: given g and w, find an integer x such that w = g^x, where g^x means the product of x copies of g. This problem is usually asked for the case where such an integer x exists, which is to say that w is an element of <g>. The general logarithm problem does not require x to be an integer, and can only be defined when the group has additional properties where non-integer powers can be defined.
In some discrete groups, the discrete logarithm problem (DLP) is hard to solve. Diffie and Hellman exploited the fact that the DLP is "hard", to provide the first viable solution for public-key cryptography. In this case, Alice chooses a random integer x, sends Bob a group element g^x, Bob chooses a random integer y, and sends Alice a group element g^y. Next, Alice computes z = (g^x)^y and Bob computes z' = (g^y)^x. Clearly z = z' = g^{xy} = g^{yx}, so Alice and Bob can compute the same value. If nobody else can compute z, then Alice and Bob have agreed on a shared secret. The shared secret can then be used to encrypt messages communicated between Alice and Bob. This protocol is Diffie-Hellman key agreement. Before this protocol, Alice and Bob would have to meet first to agree on z in secrecy. This protocol saves Alice and Bob from having to meet first.
This is called public key cryptography because the values g^x and g^y are public. They are called the public keys, and x and y are called the private keys. The pair (x, g^x) is the called the key pair. An adversary Eve gets to see the public keys. If Eve can solve the DLP, then she can find x from g and g^x. With x, Eve can compute z in the same way as Alice, namely using the public key g^y of Bob and the private key x of Alice. The shared secret is therefore not a secret, and Eve can use this to decrypt the encrypted messages that Alice and Bob send each other. Therefore, a prerequisite for the security of the Diffie-Hellman key agreement protocol is that the DLP is a "hard" problem. Eve should not be able to solve the DLP.
Fortunately, there exists groups in which cryptographers believe that the DLP is hard. Groups in which the DLP is hard are primarily from two well known classes of the groups, namely subgroups of multiplicative groups of finite fields, and subgroups of elliptic curve groups. Elliptic curve groups have the advantage over other DLP groups of using less bandwidth for transmission and storage of public keys, and enabling faster operations.
Static Diffie-Hellman key agreement is an important variant of Diffie-Hellman key agreement in which one or both of the parties has a key pair that does not change over time. If Alice has a static key pair, then her private key x and public key g^x stays the same for all transactions. An advantage to this is that Alice can have a certificate authority sign her public key g^x, then Bob can look up the resulting certificate from a database instead of requesting it from Alice. One application of this is when Bob sends an encrypted email to Alice. Alice does not need to send Bob g^x before he can encrypt the email. Instead, Bob looks up g^x from some database, which could be his address book or else some public directory. A certificate for g^x will further assure Bob that Alice (and only Alice) can decrypt the email.
Diffie-Hellman key agreement, in some of these groups, is commonly used today in the IPSec protocol for protecting Virtual Private Networks (VPN). Diffie-Hellman key agreement, including the static variant, is also an optional feature of commonly used Internet Engineering Task Force (IETF) security protocols such as Transport Layer Security (TLS) (used to secure web sites), Secure Multipurpose Internet Message Extensions (S/MIME) (used to secure email), or Secure Shell (SSH) (used to secure remote logging onto computers). It is therefore desirable to make Diffie-Hellman key agreement as secure as possible.
The security of static Diffie-Hellman key agreement depends on more than just the discrete logarithm being hard. In particular, a method for an adversary to determine Alice's static private key x is by sending Alice a specially chosen public key g^y and obtaining from Alice the resulting shared secret z = g^{xy}. In most groups, finding x with this active attack is far easier than solving the discrete logarithm problem directly.
To a person skilled in the art, the above attack is not completely realistic in two aspects. Nevertheless, it is well established that attacks of this nature are important to consider.
Firstly, the victim Alice would not likely reveal a shared secret z to an adversary. However, the purpose of z is to be used, and quantifying the exact way in which z will be used is difficult to define. Any use of z will result in some kind of exposure. Therefore, cryptographers have found it wise to consider chosen ciphertext attacks in which the victim reveals the results of her private key operation. Furthermore, demonstrating resistance to a chosen ciphertext attack means that weaker attacks are also resisted. So to be prudent, cryptographers seek to resist the strongest possible attacks, not just the weakest attacks. Therefore assuming that z will be revealed is both prudent and not entirely unrealistic.
Secondly, in most standardized versions of Diffie-Hellman key agreement, the shared secret z is used only for one purpose, namely to derive a key. To do this, a key derivation function (KDF) is used. Thus Alice will compute k = KDF (z). Key derivation functions are usually chosen as one-way functions, meaning there is no known way of reconstructing z from just k. Therefore, in the above attack it is more likely that Alice will reveal k rather than z to the adversary. However, to work, the attack needs z. The attack cannot be used to find x if Alice only reveals k. Because the KDF is one-way, the attacker cannot recover z from the revealed value of k.
Prior to consideration of the above attack, using a KDF was already known to have some less important security benefits. One of these was that the shared secret z is often distinguishable from random Because z is distinguishable from random it is not ideal for use as a key. It was not known, however, that z actually leaked any information about x until considering the above attack.
Many protocols and implementations of Diffie-Hellman key agreement are not so strict about using the KDF. In some smart card implementations, the smart card reveals z to the smart card reader, and the smart card reader applies the KDF. In such a system, a malicious smart card reader could use the attack and z values from the smart card to deduce the private key x on the smart card. In some protocols, such as basic ElGamal encryption, Chaum and van Antwerpen's undeniable signatures are designed such that the entity Alice reveals z as part of the protocol. These protocols are therefore vulnerable to attack. These two protocols, however, were designed before any benefits of a KDF were known. These protocols can easily be corrected by applying a KDF. In fact, the Diffie-Hellman Augmented Encryption Scheme (DHAES) designed by Bellare and Rogaway, was designed as an improvement of ElGamal that, among other things, applied a KDF to the shared secret z before using it as a key.
Other protocols exist, however, that are not as easily fixed by the addition of a KDF. One such protocol is the Ford-Kaliski key retrieval protocol. In this protocol, the base point g is a function of a client's password, and Alice is a server. The client chooses a random y and sends g^y to Alice. In order for the protocol to work, Alice must reveal for any client with which she does Diffie-Hellman key agreement, the resulting shared secret z. From z, the client derives a static value g^x that is a function of both the client password and the server private key x. The static value g^x is called the retrieved key, or a hardened password, because it is more difficult to guess than an ordinary password. Key retrieval, or password hardening, is the primary purpose of the Ford-Kaliski protocol The client does this by computing z^n = g^{xyu}, where u is such that yu is equivalent to 1 in the exponent space. The protocol does not work if Alice applies a KDF to z because then the client will not be able to recover a static value. An adversary could set up malicious clients to use the values of z to derive Alice's private key x. Because the adversary now knows x, guessing g^x is just as easy as guessing the password g. In particular, the adversary will probably be able to launch a dictionary search to determine the hardened password very quickly. Therefore this attack defeats the main purpose of the Ford-Kaliski protocol.
A completely different aspect is that the static Diffie-Hellman problem is hard. More precisely, it is hard to compute w^x from w without knowing the private key x. Taking w = g^y shows that the breaking the static Diffie-Hellman protocol is just as hard as finding x. This seems to be a paradox in light of the above attack, but in fact is not. In the above attack, the adversary is active. The adversary uses the victim to solve Diffie-Hellman problem for g^y. This gives the adversary the ability to solve the static Diffie-Hellman problem, which is equivalent to the problem of finding x. More precisely, the static DH problem is almost as hard as finding x, to within a certain factor.
If Alice somehow prevents the attack, say with a KDF, then it remains true that solving the static DH problem is almost as hard as finding x. This provides Alice assurance that nobody can solve the static Diffie-Hellman problem, which means that nobody other than her and Bob, who knows the private key y, can calculate the shared secret z. Results of this nature are known as provable security.
Prior provable security results on the DH problem did not deal with the static variant. Therefore, the prior results did not provide as much assurance to Alice about using her private key. Also, there were no known attacks corresponding to prior security results. The effectiveness of the provable security results on the DH, depends on the choice of the DH group. Therefore it is desirable to use a group in which the DH problem, including the static DH problem, is hard.
"Chapter 4: Public-Key Parameters" in "Handbook of Applied Cryptography", Menezes AJ, Van Oorschot PC Vanstone SA discloses that the efficient generation of public-key parameters is a prerequisite in public-key systems. A specific example is the requirement of a prime number p to define a finite field Z*_p for use in the Diffie-Hellman key agreement protocol and its derivatives. In this case, an element of high order in Z*_p is also required. Another example is the requirement of primes p and q for an RSA modulus n = pq. In this case, the prime must be of sufficient size, and be "random" in the sense that the probability of any particular prime being selected must be sufficiently small to preclude an adversary from gaining advantage through optimizing a search strategy based on such probability. Prime numbers may be required to have certain additional properties, in order that they do not make the associated cryptosystems susceptible to specialised attacks. A third example is the requirement of an irreducible polynomial f(x) of degree m over the finite field Z_p for constructing the finite field Z_{pm}. In this case, an element of high order in Z_{pm} is also required.
It introduces basic concepts relevant to prime number generation and summarizes some results on the distribution of prime numbers. Probabilistic primality tests, the most important of which is the Miller-Rabin test, are presented. True primality tests by which arbitrary integers can be proven to be prime are described but since these tests are generally more computationally intensive than probabilistic primality tests, they are not described in detail. Four algorithms are presented for generating prime numbers, strong primes, and provable primes and techniques are described for constructing irreducible and primitive polynomials, while production of generators and elements of high orders in groups are also considered.
US2003/0028771 discloses methods and apparatuses for securing cryptographic devices against attacks involving external monitoring and analysis. A "self-healing" property is introduced, enabling security to be continually re-established following partial compromises. In addition to producing useful cryptographic results, a typical leak-resistant cryptographic operation modifies or updates secret key material in a manner designed to render useless any information about the secrets that may have previously leaked from the system. Exemplary leak-proof and leak-resistant implementations are shown for symmetric authentication, certified Diffie-Hellman (when either one or both users have certificates), RSA, ElGamal public key decryption.
WO 01/35573 discloses apparatus for operating a cryptographic engine may include a key generation module for creating key pairs for encrypting substantive content to be shared between two users over a secured or unsecured communication link. The key generation module may include a point-modification module as part of an elliptic curve module for creating and processing keys. The point-modification module preferably employs a point-halving algorithm for creating and processing keys but may also employ any one or a combination of a variety of other algorithms. Hash functions may be used to further process ephemeral secrets or ephemeral keys that may be used for transactions, sessions, or other comparatively short time increments of communication. The keys generated by the key generation module may be configured to be processable by an encryption system for divulging independently to two independent parties a secret to be shared by the two independent parties. A point-halving algorithm may be provided to reduce the operation count of a cryptographic process.
D. Knuth: "The Art of Computer Programming", "Semi-numerical algorithms: Section 4.5.4, factoring into primes": 1997, Addison Wesley, Vol. 2, pages 379-415 discloses a divide and factor algorithm which relies on factoring by division. It discusses the probability of the value of the largest prime factor of around an integer x. A probability distribution function is shown which indicates that the probability that the largest prime factor is
≤
x
2
3
∼
0.6.
The probability of different prime factor values is discussed and presented.
David Chaum, Hans van Antwerpen: "Undeniable Signatures", Lecture Notes on Computer Science Advances in Cryptology, CRYPTO '89, Proceedings vol. 435 1990, pages 212-216 discloses efficient and practical undeniable signature protocols based on the "discrete log" problem. Since all signers can use the same group, signatures created by different signers commute with each other - a useful property that has not yet been achieved for digital signatures. Furthermore, a new type "binding" can be applied in the signing as well as in the challenge and response.
It is therefore an object of the present invention to obviate or mitigate the above mentioned disadvantages.

SUMMARY OF THE INVENTION
In one aspect, the present invention provides a method as set out in accompanying claim 1.
In another aspect, the present invention provides a computing device as set out in accompanying claim 11.

BRIEF DESCRIPTION OF THE DRAWINGS
The features 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 representation of a cryptographic system
- Figure 2 is a flow chart showing steps in a mod p embodiment.
- Figure 3 is a flow chart showing steps in a first simplified elliptic curve embodiment.
- Figure 4 is a flow chart showing steps in a second simplified elliptic curve embodiment.

DETAILED DESCRIPTION OF THE INVENTION
Referring therefore to Figure 1, a pair of correspondents, A, B are connected by a data communication link 12. Each of the correspondents A, B has a cryptographic unit 14 which performs public key cryptographic operations according to established protocols to permit secure communication over the link 1. The cryptographic units 14 operate within a cryptographic domain whose parameters are shared by other entities.
The domain parameters shared by correspondents A, B include the group G, the order p of the group G and a generator, g, of the group with an order n.
The invention applies both to elliptic curve groups and to multiplicative subgroups of finite fields, more commonly known as mod p groups. Because mod p groups are easier to understand, the mod p embodiment 20 is explained first and is generally shown in Figure 2. Aspects of the invention common to both cases can thus be more easily understood. Nevertheless, the preferred embodiment of the invention is with elliptic curve groups because these have several advantages in performance characteristics.

Mod p Embodiment
For simplicity of presentation, we assume that the Diffie-Hellman base or generator g in Z_p* has an order n that is prime. It will be evident to one skilled in the art that this can be extended to the case in which g has order that is not prime.
The security of the domain name parameters depends on the size of the integer factors u of n -1. If some known factor u is near to n^{1/3}, then the above attack 10 has a cost of about 3n^{1/3}. This is significantly smaller than generic DLP attacks, which have a cost of about n^{1/2}. It is known that a random n will generally have a factor u near to n^{1/3}, therefore selecting n at random will not avoid the above attack 10. In the prior art, n has generally been chosen as the output of hash function, which makes n effectively random, which will not avoid the attack. By properly selecting n it has been found possible to avoid having a factor near to n^{1/3}. It will be appreciated that the selection and testing of the parameters will be conducted using a computing device programmed to perform the necessary computations. The result of such computations is a set of domain parameters that may be used to implement cryptographic functions on the units 14.
In a first embodiment, such a factor is avoided by selecting n = hr + 1, where r is prime and h is a relatively small integer compared to r and small enough to be less than n^{1/3}. The factors of n - 1 are then of the form f or fr, where f is a factor ofh. If h is significantly smaller than n^{1/3}, then so is factor f, because f is at most h. Ifh is significantly smaller than n^{1/3}, then r is significantly bigger than n^{2/3}, so factor fr is significantly bigger than n^{1/3}. Therefore all the factors of n -1 will be significantly smaller or bigger than n^{1/3}. Therefore the attack on static Diffie Hellman is avoided.
Having chosen n in the form hr + 1, it is also necessary to choose p. A standard theorem of group theory is that the order of an element divides the order of its group. Because g is an element of Z_p*, its order n must divide the order of Z_p*, which is p - 1. Therefore p = tn + 1, for some integer t.
Because groups Z_p* have index calculus algorithms for solving the DLP, a common practice is to choose p considerably larger than n. The idea is to make the generic DLP solving algorithms in the group <g> of order n have approximately the same cost as the index calculus algorithms in Z_p*. For example, if n is approximately 2^{160} and p is approximately 2^{1024}, then both these DLP solving algorithms have a cost of approximately equivalent to 2^{80} group operations. Another common choice for n is about 2^{256} and for p about 2^{3072} in which both DLP solving algorithms take about 2^{128} operations. The main advantage of choosing such a small n is the exponentiation in the group <g> is much faster because the exponents are smaller.
To obtain p and n of sizes related as above, one merely has to choose t of the appropriate size. With the first example, one chooses t about 2^{1024-160} = 2^{864}, and in the second example t is about 2^{2816}. Because p and n are odd, one needs to choose t to be even. Similar observations about the value t mod 3, t mod 5, and so on can also be made.
The general process is to choose n first, in the form desired, and then to try several values of t until one is found that makes p prime. Rapid tests exist for determining, within a small probability, that p is prime. These tests quickly eliminate candidate values for t that are not prime. Therefore finding a good t is quite rapid In fact, starting from n, this is the best known way of finding p.
To construct n of the form hr + 1, initially an approximate size for h, or an exact value h is selected and then the approximate size of r is determined by the desired approximate size of n. In practise, various h and r in the ranges that have just been determined can be chosen and each examined for suitability. A selected value of r is tested for primality, a value n = hr + 1 computed, and then n tested for primality. Sieving techniques can be used to choose r and n that do not have small prime factors such as 2, 3 or 5. This reduces the numbers of value r and n that have be tested for primality. Using h, the sieve can be applied to both n and r together for greater efficiency. It is noted that h must be even because r and n are both prime and therefore odd.
Some care is required in choosing an appropriate size or value for h. The smallest choice is h = 2. However, this choice may be too small as although h = 2 prevents the above attack, it also prevents the provable security result in applying the present technique.
There is a range for h, in which the above attack will be thwarted while the provable security result is effective. This range depends on the number of group operations needed to perform a scalar multiplication. Optimum value of the h appears to be (9/16) (log_2 n)^2, although values of h in the range 0. 5 to 2 times this value may be used. For h of approximately this size, the static Diffie-Hellman problem will be almost as hard as finding the static Diffie-Hellman private key, to within an acceptable factor. This factor may be optimized over all choices of h. Furthermore, with this choice of h, the above attack has cost equivalent to about n^{1/2} group operations. This means that the attack is no longer any better than generic DLP solving algorithms for finding x. In such situation, the attack is therefore not relevant.
In summary, first one chooses an even h in the order of approximately (9/16) (log_2 n)^2, then one searches for r and n using sieving and primality testing on r and n, if n is selected to be prime. Finally one searches for t to find p = tn + 1 prime.
An additional efficiency improvement of this method is also possible. In this method, one searches for n and t such that p has a form that makes reduction modulo p more efficient. For example, if p has low Hamming weight, then reduction modulo p is more efficient. This will make modular multiplication, the group operation of Z_p* much more efficient.
An additional security improvement of this method is also possible. The value of r can be chosen to be verifiably random The value of r can be chosen as the output of a hash function.
These two additional improvements can be combined by choosing r verifiably at random, and then search for a value t that makes p have efficient modular reduction
If one is not concerned about the above attack, because such an adversary is unrealistic for a particular implementation of a particular protocol, then one can choose the Diffie-Hellman group differently. It may not be necessary to avoid a factor u of size close n^{1/3}, however one still wants both the static Diffie-Hellman problem and the general Diffie-Hellman problem to be hard To make the static Diffie-Hellman problem hard, one just needs a factor of n -1 of size approximately (9/16) (log_2 n)^2. It is not clear from existing number theory knowledge whether random n will have a factor of such a size. Therefore, one can choose random n and look for such a factor, or construct n with a factor h of such a size. The latter could be done by choosing h, choosing any r (not necessarily prime), and then testing n = hr + 1 for primality.
To ensure that the ephemeral, or two-sided, Diffie-Hellman problem is hard, one can use existing provable security results. The results of Maurer and Wolf require one to find an auxiliary group, usually an elliptic curve defined over a finite field of size n. The auxiliary group has to have smooth order (no large prime factors). Searching for such an auxiliary group takes considerable effort, and may be out of reach for larger values of n. In fact, it is known that finding such groups is approximately as hard as factor integer of the same size as n.
An older result, of den Boer, says that n - 1 is smooth, that the (ephemeral) Diffie-Hellman problem is almost as hard the DLP.
A further enhancement of the present technique therefore includes a method of choosing n = 1 + s, where s is a smooth integer. This s can be found as a product of small primes such that correct size is obtained. Then n is tested for primality. Several values of s may be tried. A benefit of choosing n in this way, is that generally, it will mean that n - 1 has a factor of size close enough to (9/16) (log_2 n)^2, which ensures that the static Diffie-Hellman problem is hard, not just the ephemeral Diffie-Hellman problem.
With such an n, the prime p = tn + 1can be found as above. Furthermore, is also possible with this method to aim for n and p of special structure, such as low Hamming weight.

Elliptic Curve Embodiment
In principle, the tecnique as described above works for the case of elliptic curve groups as well. More precisely, the desirable criteria for n are identical. However, in this case, the generator g of order n is not an element of Z_p*, but an element of an elliptic curve group E. In the mod p case, once n is determined, it is relatively straightforward to find the group Z_p*. This can not be said for elliptic curves. For a determined n it is still quite difficult to fmd an elliptic curve group E.
Because elliptic curves make user operations more efficient than for groups Z_p*, the elliptic curve case is the preferred embodiment of the present invention The methods of this embodiment are slightly more complicated than for the Z_p* case, but nonetheless are worthwhile.
For greater clarity of presentation, some simplified forms of the method in the elliptic curve embodiment are presented and shown in Figures 3 and 4.
In the first simplified form 30, the elliptic curve will be defined over a binary field For such curves, determining the order of the elliptic curve group is very easy. The simplified method is to choose random curves, count the number of points, check that the number of points is 2n, where n is prime, and n -1 meets the desired criteria. The preferred criteria are that n - 1 = hr, where r is prime and h is approximately (9/16) (log_2 n)^2. Alternate criteria are that n - 1 is smooth, provided that one does not care about the above attack.
In the second simplified form, the elliptic curve will be defined over a prime field of order q. The value of q will be determined after determining the value of n. The value of n is chosen as above in the case for mod p groups. The value ofn can meet the preferred criteria or the alternate criteria. Then, the complex multiplication method as set forth in ANSI x 9.62 or IEEE 13.63 is used to find a value of q and an elliptic curve E defined over q that has an order n.
Usually, the complex multiplication method involves selecting q first, because certain values of q offer better efficiency for users. The complex multiplication method works, however, if n is chosen first Once q and n have been found with the correct number theoretical relationship, which is the first phase of the complex multiplication method, the second phase determines the coefficients that define the elliptic curve E.
A disadvantage of the second simplified method is that the resulting q will have a form that is more or less random in the Hasse interval of n, which is all integers within about a distance of n^{1/2} from n. For better user efficiency reasons, special forms of q are highly desirable, such as low Hamming weight in binary expansion.
In other words, it is desirable for both q and n to have special forms. The form for q is for efficiency and the form for n is for security. To do this, the first phase of the complex multiplication method is slightly modified. One tries q and n of the special form desired and then tests this pair to see if it meets the condition required by the complex multiplication (CM) method. This condition is a relatively straightforward to test. It is less easy to solve for a n that meets the condition once q is given, or vice versa.
A modification of the first phase of the complex multiplication is to try several different pairs of q and n of the desired form, test the CM method condition for q and n, repeat until the CM condition is met, and then find defining coefficients a and b of the elliptic curve E using the usual process of the CM method
The CM method is a known method, but its modified form is not. With the modified form of the CM method as described in the preferred embodiment of the present invention, one is able to find highly efficient and highly secure Diffie-Hellman elliptic curve groups.
As an example to demonstrate the viability of this method. Using the alternate criteria, namely that n - 1 is smooth, the inventors have found the pair n = 1 + 55 (2^{286}) and q = 9 + 55(2^{288}), both of which are primes. One skilled in the art of the CM method will appreciate that the discriminant for this pair is 55. This discriminant is nontrivial in the sense that the Kronecker class number is larger than one, so the endomorphism ring of the elliptic curve is not a unique factorization domain. In particular, this means that coefficients a and b of the elliptic curve E cannot be found from a predetermined table and must be calculated by solving polynomials equations of moderately large degree over the finite field of order q.
As described above, the techniques may be used to generate domain parameters having desirable characteristics. The manner in which these characteristics are generated also lends itself to checking the efficacy of domain parameters supplied by third parties to ensure they are not vulnerable to attack. The parameters may be checked to ensure tihat the values of p and n satisfy the required form. If they do not meet these criteria, then the domain parameters may be rejected.
1. A method for computing a shared secret using a computing device (A) comprising a cryptographic unit (14) and a private key, the method comprising:
the computing device (A) obtaining a public key of a correspondent computing device (B);
the computing device (A) computing the shared secret by combining the private key and the public key of the correspondent computing device (B); and
wherein the public key of the correspondent computing device (B) and the shared secret are elements of a group of order n, and n is a prime number such that (n-1) has a prime factor r, characterized in that r is substantially larger than n^{2/3}.
2. The method of claim 1 wherein the group is an elliptic curve group defined over a finite field.
3. The method of claim 2 wherein the elliptic curve group is determined using a complex multiplication method in which the size of the finite field and the order n are determined before determining coefficients defining the group.
4. The method of claim 1 wherein the group is a multiplicative group of a finite field.
5. The method of claim 4 wherein the prime factor r is obtained first, then n is obtained, and then the finite field size is computed.
6. The method of any one of claims 1 to 5 wherein the shared secret is used in establishing an encryption key.
7. The method of any one of claims 1 to 5 wherein the shared secret is used in a Ford-Kaliski key retrieval protocol.
8. The method of any one of claims 1 to 7 wherein n is of the form n=hr+1.
9. The method of claim 8 wherein h is in a range between (9/32) (log_2n)^2 and (9/8) (log_2n)^2.
10. The method of claim 8 or claim 9 wherein h is approximately (9/16) (log_2n)^2
11. A computing device (A) comprising a cryptographic unit (14), the computing device (A) configured for computing a shared secret according to the method of any one of claims 1 to 10.
1. Verfahren zum Errechnen eines gemeinsamen Geheimnisses unter Verwendung einer Rechenvorrichtung (A) mit einer Kryptographieeinheit (14) und einem privaten Schlüssel, wobei das Verfahren aufweist:
dass die Rechenvorrichtung (A) einen öffentlichen Schlüssel einer Korrespondenzrechenvorrichtung (B) erhält, und
dass die Rechenvorrichtung (A) das gemeinsame Geheimnis durch Kombinieren des privaten Schlüssels und des öffentlichen Schlüssels der Korrespondenzrechenvorrichtung (B) errechnet,
wobei der öffentliche Schlüssel der Korrespondenzrechenvorrichtung (B) und das gemeinsame Geheimnis Elemente einer Gruppe der Ordnung n sind und n eine Primzahl ist, so dass (n-1) einen Primfaktor r aufweist, dadurch gekennzeichnet, dass r im Wesentlichen größer als n^{2/3} ist.
2. Verfahren nach Anspruch 1, wobei die Gruppe eine Elliptische-Kurven-Gruppe ist, die auf einem finiten Feld definiert ist.
3. Verfahren nach Anspruch 2, wobei die Elliptische-Kurven-Gruppe unter Verwendung eines komplexen Multiplikationsverfahrens bestimmt wird, in dem die Größe des finiten Felds und die Ordnung n bestimmt werden, bevor Koeffizienten bestimmt werden, welche die Gruppe festlegen.
4. Verfahren nach Anspruch 1, wobei die Gruppe eine multiplikative Gruppe eines finiten Felds ist.
5. Verfahren nach Anspruch 4, wobei zunächst der Primfaktor r erhalten wird, dann n erhalten wird und dann die finite Feldgröße errechnet wird.
6. Verfahren nach einem der Ansprüche 1 bis 5, wobei das gemeinsame Geheimnis zur Erstellung eines Chiffrierschlüssels verwendet wird.
7. Verfahren nach einem der Ansprüche 1 bis 5, wobei das gemeinsame Geheimnis in einem Ford-Kaliski-Schlüssel-Wiedergewinnungs-Protokoll verwendet wird.
8. Verfahren nach einem der Ansprüche 1 bis 7, wobei n in der Form n=hr+1 ist.
9. Verfahren nach Anspruch 8, wobei h im Bereich zwischen (9/32) (log_2n)^2 und (9/8) (log_2n)^2 ist.
10. Verfahren nach Anspruch 8 oder 9, wobei h ungefähr (g/16) (log_2n)^2 ist.
11. Rechenvorrichtung (A) mit einer Kryptographieeinheit (14), wobei die Rechenvorrichtung (A) zum Errechnen eines gemeinsamen Geheimnisses nach dem Verfahren nach einem der Ansprüche 1 bis 10 konfiguriert ist.
1. Procédé de calcul d'un secret partagé en utilisant un dispositif de calcul (A) comprenant une unité cryptographique (14) et une clé privée, le procédé consistant en ce que :
le dispositif de calcul (A) obtient une clé publique d'un dispositif de calcul correspondant (B) ;
le dispositif de calcul (A) calcule le secret partagé en combinant la clé privée et la clé publique du dispositif de calcul correspondant (B) ; et
dans lequel la clé publique du dispositif de calcul correspondant (B) et le secret partagé sont des éléments d'un groupe d'ordre n, et n est un nombre premier tel que (n-1) a un facteur premier r, caractérisé en ce que r est sensiblement supérieur à n^{2/3}.
2. Procédé selon la revendication 1, dans lequel le groupe est un groupe de courbes elliptiques défini sur un champ fini.
3. Procédé selon la revendication 2, dans lequel le groupe de courbes elliptiques est déterminé en utilisant un procédé de multiplication complexe dans lequel la taille du champ fini et l'ordre n sont déterminés avant de déterminer les coefficients définissant le groupe.
4. Procédé selon la revendication 1, dans lequel le groupe est un groupe multiplicatif d'un champ fini.
5. Procédé selon la revendication 4, dans lequel le facteur premier r est obtenu en premier, ensuite n est obtenu, et ensuite la taille du champ fini est calculée.
6. Procédé selon l'une quelconque des revendications 1 à 5, dans lequel le secret partagé est utilisé pour établir une clé de chiffrement.
7. Procédé selon l'une quelconque des revendications 1 à 5, dans lequel le secret partagé est utilisé dans un protocole de récupération de clé de Ford-Kaliski.
8. Procédé selon l'une quelconque des revendications 1 à 7, dans lequel n est sous la forme n = hr+1.
9. Procédé selon la revendication 8, dans lequel h est dans une plage entre (9/32)(log_2n)^2 et (9/8) (log_2n)^2.
10. Procédé selon la revendication 8 ou la revendication 9, dans lequel h est approximativement égal à (9/16) (log_{2n})^2.
11. Dispositif de calcul (A) comprenant une unité cryptographique (14), le dispositif de calcul (A) étant configuré pour calculer un secret partagé selon le procédé de l'une quelconque des revendications 1 à 10.

REFERENCES CITED IN THE DESCRIPTION
This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.

Patent documents cited in the description
- US
20030028771
A
[0026]
- WO
0135573
A
[0027]

Non-patent literature cited in the description
- The Art of Computer Programming
D. KNUTH
Semi-numerical algorithms: Section 4.5.4, factoring into primes
Addison Wesley
19970000
2
379
415
[0028]
- DAVID CHAUM
HANS VAN ANTWERPEN
Undeniable Signatures
Lecture Notes on Computer Science Advances in Cryptology, CRYPTO '89, Proceedings
19900000
435
212
216
[0029]