Abstract:
A method for protecting a generation, by an electronic circuit, of at least one prime number by testing the prime character of successive candidate numbers, including: for each candidate number: the calculation of a reference number involving at least one first random number, and at least one primality test based on modular exponentiation calculations; and for a candidate number having successfully passed the primality test: a test of consistency between the candidate number and its reference number.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     This application claims the priority benefit of French patent application number 09/53523, filed on May 28, 2009, entitled “PROTECTION OF A PRIME NUMBER GENERATION FOR AN RSA ALGORITHM,” which is hereby incorporated by reference to the maximum extent allowable by law. 
     BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention generally relates to electronic circuits and, more specifically, to circuits executing RSA-type asymmetrical ciphering algorithms. The present invention more specifically relates to the protection, during the generation of prime numbers in an electronic circuit, against side channel attacks, for example, by statistical analysis of the power consumption of the circuit (SPA—simple power analysis) or of its electromagnetic signature, or against fault-injection attacks. 
     The present invention applies to any electronic circuit exploiting an algorithm exploiting a prime number factorization and, more specifically, to chip cards. 
     2. Discussion of the Related Art 
     The RSA algorithm is one of the most commonly used asymmetrical ciphering algorithms (with a public key). This algorithm is used to cipher/decipher data or to sign data and enable them to be authenticated. It is based on the use of a pair of keys comprising a public key and a private key. In ciphering/deciphering mode, the public key is used by a transmitter to cipher data to be confidentially communicated to a receiver, the latter using its private (or secret) key to decipher the data. For an authentication, the private key is used by the transmitter to sign the data while the public key is used by the receiver to authenticate the signature. 
     The public key is relatively widely accessible to enable the transmitter of the ciphered data or the receiver of the signed data to exploit these data. However, the private key is reserved to the circuit having created the pair of keys. The holder of the pair of keys may directly communicate the public key to the other party to enable it to process the data. 
     The generation of the pair of public and private keys requires the use of two different relatively prime numbers “p” and “q”, of relatively large size (typically, 1,024 or 2,048 bits). The product of these prime numbers represents encryption modulus “n”. Numbers p and q are selected so that numbers p−1 and q−1 are prime with a quantity “e”, called public exponent, the latter being then prime with the Euler indicator “φ(n)” of product n (φ(n)=(p−1)(q−1)). As a result, there exists an integer “d” such that product e*d is congruent to 1 modulo φ(n). Pair n and e represents the public key while pair n and d represents the private key. Private exponent d represents the inverse of exponent e, modulo (p−1)(q−1). Prime numbers p and q are only present in the circuit contained the private key. 
     The robustness of the RSA algorithm depends on prime numbers p and q. To “break” the RSA algorithms based on the public key, one needs to be able to factorize number n, and thus to obtain prime numbers p and q. Once this factorization is known, private exponent d can be calculated from public exponent e (d is obtained by calculating the inverse of e modulo (p−1)(q−1)). It is currently considered that by using modules n of sufficient size (typically on the order of 1,500 bits), current algorithms do not enable, within a reasonable time, to factorize number n. 
     However, the introduction of numbers p and q into the electronic circuit or their generation by this circuit is particularly critical in terms of security, since their discovery by a hacker at this time of the circuit life provides him with the factorization of number n. 
     A first technique for generating RSA keys comprises generating these keys outside of the electronic circuit. Quantities p and q are introduced into the electronic circuit in a customization phase. This technique is not responsive to fault injection attacks since the keys are not generated by the actual electronic circuit. 
     A second known technique comprises having the actual electronic circuit generate the prime numbers in a secure environment (in practice in a protected installation, with a reserved access). With this technique, attacks are not a problem either during the prime number generation. 
     However, more and more often, electronic circuits are desired to be able to generate their RSA keys outside of such secure environments. This, for example, enables regenerating new keys in the case where a previous key has been repudiated (key assumed to have been hacked). Such a generation is for example performed during a customization of the electronic circuit in a non-secure environment or during a first use (for example, for circuits used for signature calculations or electronic identifiers). According to an example of application to electronic passports, the key is desired to be generated by the electronic chip contained in the passport once it is in its holder&#39;s hands. Thus, this key cannot have been previously used in a passport authentication procedure. 
     Public exponent e may be a parameter of the public key infrastructure (PKI) and is the same for all keys. It is, for example, introduced into the electronic circuit during the manufacturing thereof (in a ROM) or during a customization phase (in an EEPROM). 
     Public exponent e may also be generated by the electronic circuit, for example, by selection of a random number, and may then be communicated to the elements with which it needs to communicate. 
     The public key (public exponent and encryption modulus) is thus either known by the receiver (signature) or by the transmitter (ciphering), or communicated thereto (for each transaction and once and for all) by the electronic circuit holding the private key. The public key further needs generally to be certified. 
     The generation of large prime numbers is costly in terms of time and calculation. In particular, so-called primality tests which enable to validate or not the prime character of a number generally implement modular exponentiations requiring a significant number of calculations (for example, the so-called Miller-Rabin primality test). This is why it is desired to only perform such tests for candidate numbers already having successfully passed tests with respect to relatively small prime numbers. Such tests correspond to divisions by relatively small prime numbers or to comparisons with respect to tables of prime numbers. For example, a Miller-Rabin test can be performed with a small base (two, for example) or a largest common divider calculation may be performed (for example, adding bytes modulo 255 to obtain a result smaller than 255 and then calculate the largest common divider of this result with 255—if it is different from 1, a single test can tell that the number is not dividable by the three factors of 255, that is, 3, 5, and 17). 
     When the prime numbers are generated by the electronic circuit in a non-secure environment, the circuit is capable of undergoing fault injection attacks (power supply disturbance, laser attacks, etc.) exploited by analysis of the inputs-outputs or of the circuit consumption, or to undergo side channel attacks (SPA or DPA, or electromagnetic analysis). 
     Another risk of the generation of prime numbers by the electronic circuit is an attack aiming a modifying the number finally selected. An attack at the end of a Miller-Rabin test may be used to modify the number taken into account by the algorithm. If one of numbers p or q is not prime, encryption modulus n is easier to factorize, which decreases the security of the RSA algorithm. 
     SUMMARY OF THE INVENTION 
     It would be desirable to protect the generation of prime numbers and, thereby, the generation of the keys of an algorithm using a prime number factorization, when said numbers are generated by the electronic circuit exploiting such keys. 
     It would further be desirable to be able to detect a modification of a prime number provided by the generation process. 
     It would further be desirable to be able to mask the prime number generation. 
     To achieve all or part of these objects as well as others, at least one embodiment of the present invention provides a method for protecting generation, by an electronic circuit, of at least one prime number by testing the prime character of successive candidate numbers, comprising:
         for each candidate number:   calculating a reference number involving at least one first random number; and   performing at least one primality test based on modular exponentiation calculations; and   for a candidate number having successfully passed said primality test:   testing a consistency between the candidate number and its reference number.       

     According to an embodiment of the present invention, the reference number is obtained by subtracting from or by adding to the candidate number a quantity depending on said first random number. 
     According to an embodiment of the present invention, each candidate number is submitted, before the primality test based on modular exponentiation calculations, to at least one primality test based on a sieve table comprising as many elements as there are prime numbers between a first threshold and a second threshold, an initial candidate number being obtained by multiplying an arbitrary number by a first product of the prime numbers smaller than the first threshold. 
     According to an embodiment of the present invention, passing from one candidate number to the next one comprises adding, to the current candidate and reference numbers, said first product. 
     According to an embodiment of the present invention, passing from one candidate number to the next one comprises adding, to the current candidate and reference numbers, a multiple of said first product, the multiplier being a function of at least a random number and a second product of the prime numbers ranging between the first and second threshold. 
     According to an embodiment of the present invention, said multiplier further is a function of a public exponent of the RSA algorithm. 
     According to an embodiment of the present invention, the sieve table is based on the reference numbers. 
     According to an embodiment of the present invention, the sieve table is, for example new candidate number, updated by adding to each of its elements said first product modulo the concerned element. 
     According to an embodiment of the present invention, each candidate number is submitted, before the primality test based on modular exponentiation calculations, to a test of compliance with a public exponent of the RSA algorithm. 
     According to an embodiment of the present invention, the primality test based on modular exponentiation calculations is a Miller-Rabin test. 
     At least one embodiment of the present invention also provides an electronic circuit comprising means for implementing the described method. 
     The foregoing objects, features, and advantages of the present invention will be discussed in detail in the following non-limiting description of specific embodiments in connection with the accompanying drawings. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  is a block diagram of an embodiment of an integrated circuit of the type to which the present invention applies as an example; 
         FIG. 2A  very schematically illustrates a ciphering by means of an RSA algorithm; 
         FIG. 2B  schematically illustrates a deciphering by means of an RSA algorithm; 
         FIG. 3  is a block diagram illustrating a ciphered data transmission system; 
         FIG. 4  is a block diagram illustrating usual steps of generation of prime numbers within an electronic circuit implementing an RSA-type algorithm; 
         FIG. 5  is a block diagram showing steps of an embodiment of the prime number generation method; and 
         FIG. 6  partially shows in the form of block another embodiment of the prime number generation method. 
     
    
    
     DETAILED DESCRIPTION 
     For clarity, the same elements have been designated with the same reference numerals in the different drawings. Further, only those steps and elements which are useful to the understanding of the present invention have been shown and will be described. In particular, what exploitation is made by the electronic circuit of the algorithm using the keys based on the prime numbers has not been detailed, the present invention being compatible with any usual exploitation (ciphering, signature calculation) of the generated prime numbers. 
     Embodiments of the present invention will be described hereafter in relation with an example of application to the RSA algorithm used in ciphering/deciphering. It should however be noted that the present invention applies whatever use is made of the RSA algorithm based on the generated prime numbers, the present invention applying in particular to RSA signatures. More generally, the present invention applies to any algorithm having its keys depending on a prime number factorization, for example, the so-called Rabin ciphering system. 
       FIG. 1  very schematically shows in the form of blocks an example of an electronic circuit  1  (for example, a smart card) of the type to which the present invention applies. Such a circuit comprises a processing unit  11  (PU) capable of communicating, over one or several data, address, and control buses  12 , with different elements, among which one or several non-volatile memories  13  (NVM), generally a ROM containing all or part of the programs and an EEPROM intended to contain the RSA keys, one or several volatile memories  14  (typically of RAM type), and interface circuits  15  (I/O) enabling circuit  1  to communicate with the outside. In the applications more specifically aimed by the present invention, circuit  1  also comprises a ciphering or signature calculation processor  16  (CP) that may coincide with central processing unit  11 . Circuit  1  is capable of implementing different functions performed by hardware and/or software elements which have been symbolized by a block  17  (FCT) in dotted lines. One of these functions, symbolized by a block  18  (PN GEN), is the generation of prime numbers to be used as keys of an RSA-type algorithm. Other components and circuits may equip electronic circuit  1  according to its destination. Further, direct links (not shown) between sub-assemblies of the circuit in order to exchange data, addresses, and/or control signals may be provided. 
       FIGS. 2A and 2B  illustrate the implementation of an RSA-type algorithm. The RSA calculation cell is symbolized by a block  20  in  FIG. 2A  (ciphering side) and by a block  21  in  FIG. 2B  (deciphering side). These calculation cells may in practice be identical, be they software or hardware cells. 
     The ciphering of a data message M, shown as an integer, is introduced into the RSA calculation block which further contains or receives encryption modulus n and encryption exponent e of the public key. Integer M is smaller than encryption modulus n. The RSA block calculates ciphered message C which represents modular exponentiation M e  mod n. 
     As to the deciphering by the circuit holding the private key (n, d), message C is submitted to a modular exponentiation based on exponent d and on modulo n, that is, cell  21  provides message M representing C d  mod n. 
       FIG. 3  is a block diagram illustrating an example of transmission of data DATA (block  24 ) representing an arbitrary digital content from a transmitter  22  to a receiver  23 . The receiver has the RSA keys and starts, if it is not known by the transmitter, by transmitting the public key thereto, that is, factorization module n and public exponent e. This enables the transmitter to cipher the data and to transmit them in the form of ciphered message C. Receiver  23  uses its private key (n, d) to decipher the messages and obtain data DATA (block  25 ). 
     The transmissions are capable of undergoing hacking attempts aimed at discovering the factorization of number n. The present invention does not aim at such attacks once the keys have been generated but at attacks that may happen during the prime number generation, which only occurs once (or at each generation of a new pair of keys). 
     The generation of a prime number comprises modifying a candidate number until it becomes prime. As indicated previously, simplified tests are performed to verify whether the candidate is prime with relatively small numbers before submitting it to a primality test adapted to large numbers. Tests adapted to large numbers are generally based on the Fermat theorem, according to which if “u” is a prime number, v u-1  is congruent to 1 modulo u for any integer “v”, that is, there is no possible factorization of number “u” by an integer other than 1 or u. The primality test now most currently used for the prime number generation is the so-called Miller-Rabin test. This test implements modular exponentiation calculations to verify that the candidate is not dividable by another number than 1 and is described, for example, in work “Handbook of Applied Cryptography” by A. Menezes, P. van Oorshchot, and S. Vanstone, published in 1996 (CRC Press), chapter 4, point 4.2.3, pages 138-140. In fact, primality tests are not perfect but the error probability is low enough to be able to consider the candidate as prime. 
       FIG. 4  is a block diagram illustrating the steps of a usual method for generating a prime number (arbitrarily designated as p), intended to represent one of the two prime numbers of the RSA factorization modulus. The method of  FIG. 4  is generally implemented twice in a row to obtain numbers p and q. 
     An arbitrary number k is first selected (block  31 , RANDOM), for example, by random selection. Then, this number is modified to obtain a candidate non-dividable by prime numbers smaller than a first threshold n 1 . 
     According to an example, number k is multiplied (block  32 , X) by product A 1  of prime numbers b i  smaller than threshold n 1  (i ranging between 1 and m 1  and m 1  representing the number of prime numbers of the group [1, n 1 ]. Threshold n 1  is selected to be relatively small. For example, n 1 =3, A 1 =6 (m1=3 and b 1 =1, b 2 =2, b 3 =3). If n 1 =5, A 1 =30 (m 1 =4 and b 1 =1, b 2 =2, b 3 =3, b 4 =5). Then, one (1) is added to or subtracted from the calculated product (block  32 ′, ±1) so that, in the example where n 1 =3, it is neither dividable by 2 nor by 3. A first candidate a=k·A 1 ±1, prime with numbers 2 and 3, is obtained. 
     The size desired for numbers p and q is set. Accordingly, the size of candidates should correspond to that desired for numbers p and q. The size of number k thus depends on that of number A 1 . In the above example, for a number a of 1024 bits and a number A 1  of 30, number k is selected over 1019 bits. 
     According to another example, number k is modified by performing operation k=k−(k mod A 1 ) to make it dividable by A 1 . Then, a number, arbitrarily selected from a table of numbers prime with A 1 , is added. A candidate a, prime with prime numbers smaller than n 1 , is then obtained. In this example, number k has the same size as that desired for number a. 
     The next step (block  33 ) comprises constructing a sieve table ST (SIEVE TABLE), having each of its terms representing the result of the division of candidate a by one of the prime numbers comprised between first threshold n 1  and a second higher threshold n 2 . This amounts to filling the table with values a mod b i , for b i  ranging between n 1  and n 2  (hence for i ranging between m 1  and m 2 ). Such a filling uses divisions implying the candidate, which are sensitive to side channel attacks. Threshold n 2  is selected to avoid for the table to be too large and so that the calculations which will be subsequently performed, for each candidate, remain less consuming (in terms of time and power required for the calculations) than a Miller-Rabin test on the candidate. For example, threshold n 2  is equal to 128 or 256. For simplification purposes, threshold n 1  is considered as part of both groups [1, n 1 ] and [n 1 , n 2 ], but in practice, threshold n 1  is only part of one of these groups in order to save a test iteration, as threshold n 1  is usually a prime. 
     Once the sieve table has been initialized, the next operations are performed as long as candidate a does not correspond to a prime number acceptable for the implementation of the RSA algorithm. 
     It is started by verifying that the candidate is prime with all the numbers contained in interval [n 1 , n 2 ]. This amounts to verifying (block  35 , 0ε[ST]?) that this table contains no zero value. The presence of a zero value means that candidate a is a multiple of the corresponding prime number in the table. 
     If test  35  confirms (output N of block  35 ) that the candidate is prime with all the numbers in interval [n 1 , n 2 ], it is verified (block  37 ) that the candidate is appropriate for an implementation of the RSA algorithm. For this purpose, it should be verified that number a−1 is prime with e. In practice, it is checked whether value a mod e (the remainder of the division of a by e) is equal to 1. If not, candidate a is compatible with the RSA, that is, it will respect the condition for exponent e to be an integer prime with Euler indicator (p−1)(q−1). 
     Once test  37  has been passed (output N), the candidate is finally submitted to several executions (generally from a few executions to a few tens of executions) of a Miller-Rabin primality test (block  38 , MR tests OK?). If it passes the test successfully (output Y of block  38 ), candidate a is provided (block  39 , OUTPUT p=a) as prime number p. 
     As soon as one of tests  35 ,  37 , or  38  indicates that the candidate is not appropriate (outputs Y of blocks  35  and  37  or N of block  38 ), a new candidate is selected. For this purpose, it is started (block  36 , a=a+A 1 ) by adding value A 1  to the rejected candidate. Then, sieve table [ST] is updated. This amounts to adding (block  34 , [ST]+A 1  mod b i ) quantity A 1  modulo b i  to each of the elements (identified by i) of the table and the method returns to step  35 . Although this has not been shown, a variable containing value a mod e which will then be used for test  37  is also updated. 
     Once a first prime number p has been obtained, the method is implemented again to select the second prime number q necessary to implement the RSA algorithm. An additional step then comprises making sure that numbers p and q are relatively prime (step not illustrated in  FIG. 4 ). Since these are prime numbers, it is sufficient to check that they are different. 
     The succession of the prime number generation steps is particularly sensitive to side channel or fault injection attacks. Such attacks may have the purpose of discovering the generated prime number or of forcing the generation of a non-prime number. In both cases, this may enable a hacker to discover the private key. 
       FIG. 5  is a block diagram illustrating an embodiment of the prime number generation method, protected against possible side channel attacks (power analysis or electromagnetic response analysis) or fault injection attacks. This block diagram should be compared with that of  FIG. 4 . 
     As previously, it is started by selecting a threshold n 1  conditioning a product A 1  used in primality tests. For example, threshold n 1  is 3 (m 1 =3) or 5 (m 1 =4) and product A 1  is 6 or 30. Other values of n 1  may be selected. 
     Then (block  31 , a), an arbitrary number k is selected and modified to be made non-dividable by the prime numbers smaller than number n 1 . As previously, the size of number k thus depends on that of number A 1 . For example (block  32 , a=k·A 1 +1), number k is multiplied by product A 1  and added to 1 (as a variation, 1 is subtracted to this result). Other ways of generating first candidate a may be used. 
     The next step (block  41 , w=a−e·r 2 ·A 2 ) comprises generating a reference number w which will be used at the end of the generation process to make sure that candidate a has not been disturbed and to protect the divisions by small prime numbers against side channel attacks. 
     Quantity w is obtained, for example, by subtracting, from candidate a, value e·r 2 ·A 2 , where e represents the public exponent (for example, over 32 or 64 bits), where r 2  represents a random number, and where A 2  represents the product of the prime numbers in an interval [n 1 , n 2 ]. Threshold n 2  represents, as previously, a threshold subsequently used for the creation of a sieve table. For example, threshold n 2  is selected to be equal to 128 or 256. Other values of n 2  may be selected. 
     The size of random number r2 is equal to the size of candidate a, decreased by the size of public exponent e and by the size of product A 2 . Thus, the subtracted term has the same size as number a. 
     This embodiment thus applies to the case where public exponent e is of relatively small size (smaller than some hundred bits). The present invention however also applies to larger numbers e (for example of same size as the prime numbers to be generated). In this case (not shown), number e is not taken into account in primality tests which precede the Miller-Rabin test and its primality with the selected candidate is verified at the end of this test by a specific test (by division). 
     After, it will be assumed that number e is sufficiently small to be taken into account in the generation of numbers p and q, which avoids a complete primality test on number e. 
     The next step (block  43 ) of the generation of number w comprises generating sieve table [ST] based on reference w. It will be seen in relation with  FIG. 6  that the sieve table may also be generated based on candidate a. 
     In the embodiment of  FIG. 5 , table [ST] comprises as many elements as there are prime numbers b i  in interval [n 1 , n 2 ]. Each element corresponds to the division of reference w by the corresponding prime number b i  and is equal to a mod b i . The fact for quantity w to be created by subtracting a multiple of quantities e and A 2  from number a enables the values of the sieve table to represent both result w mod b i  and a mod b i . 
     Then, the following steps are carried out iteratively as long as an acceptable candidate has not been found. 
     It is started (block  35 ) by making sure that numbers a and w are prime with all the prime numbers b i  of interval [n 1 , n 2 ]. For this purpose, it is verified that one of the elements of table [ST] is zero. If not, it is proceeded to the next test (block  37 , a mod e=1?) to verify the compatibility of the candidate with public exponent e. 
     If a candidate has passed all the previous tests (output N of block  37 ), it is submitted to the Miller-Rabin test (block  38 ). 
     As soon as one of tests  35 ,  37 , or  38  indicates that the candidate is not eligible (outputs Y of blocks  35 ,  37  or N of block  38 ), a new candidate and a new reference are calculated (block  46 , a=a+A 1 , w=w+A 1 ) by addition to the previous values of value A 1 . Then (block  34 , [ST]+A 1  mod b i ), sieve table [ST] is updated by addition of value A 1  to all its elements modulo b i . In practice, a variable containing value a mod e (and thus used for test  37 ) is also updated to a mod e+A 1 . 
     The new candidate is then submitted to tests  35  and  37 ,  38  (the order of tests  35  and  37  is of no importance). 
     If the candidate is eligible (output Y of block  38 ), an additional step (block  44 , a=w+e·r 2 ·A 2 ?) enables to verify the integrity of the candidate with respect to the beginning of the calculation, that is, its consistency with reference w. For example, value e·r 2 ·A 2  is added to reference w and it is verified that the result is equal to candidate a. If so (output Y of block  44 ), candidate a is provided (block  39 , OUTPUT p=a) as a prime number p. Otherwise (output N of block  44 ), this means that a disturbance has occurred in the prime number generation. The circuit then proceeds to an error processing (ERROR). As a variation, the test of block  44  verifies that quantity A 2  divides value a−w. Such a variation enables to avoid storing random quantity r 2 . According to another variation, step  41  is replaced by an addition and step  44  is replaced by a subtraction. 
     The error processing is, for example, the cancellation of the generated prime number (the process is restarted from step  31 ) or a disabling of the circuit. Such actions to be taken in case a hacking attempt has been detected are conventional per se and multiple solutions exist according to applications. 
     Consistency or integrity test  44  enables to avoid an attack imposing a number different from number a, after the Miller-Rabin test. 
     Once a first prime number p has been generated, the process is resumed to generate a second prime number q while verifying that numbers p and q are relatively prime. Finally, to implement the RSA algorithm, factorization module n is calculated (n=p·q) and is transmitted (with exponent e) to form the public key to any entity likely to need it. Numbers p and q are only stored in electronic circuit  1 . 
     The fact of constructing the sieve table based on reference number w (instead of number a) enables masking this construction. 
       FIG. 6  is a block diagram illustrating another embodiment. Only the steps modified with respect to  FIG. 5  are shown. 
     As compared with the previous embodiment, the sieve table is based on candidate number a. It is thus initialized (block  43 ′, SIEVE TABLE, a mod b i[n1,n2] ) with terms a mod b i  of interval [n 1 , n 2 ]. To preserve an updating of the sieve table by addition of quantity A 1 , a quantity f to be added from one candidate to the next candidate and from one reference number to the next reference number (block  46 ′) is constructed so that quantity f is equal to A 1  mod b i  and to A 1  mod e. For example, a random number r 1  is selected independently from number r 2  and is multiplied by product e·A 2 . The size of number r 1  is such that the size of product r 1 ·e·A 2  is smaller (by from a few bytes to a few tens of bytes) than the length required for the prime number to be generated. This enables the passing from one candidate to another to come along with a modification of a large number of the bits. Then, 1 is added to the product. Thus, as illustrated in  FIG. 6 , a new candidate and a new reference number are obtained by adding (block  46 ) value f·A 1 , with f=e·r 1 ·A 2 +1, to the previous values. The new candidate and reference number remain prime with the prime numbers smaller than threshold n 1 . Since A 2  is equal to 0 modulo b i , product (e·r 1 ·A 2 +1) is equal to 1 mod b i . The table can then be updated (block  34 ), as in the previous embodiment, by addition of value A 1  to each of the elements of table [ST] modulo prime number b i  of the concerned element. 
     Various embodiments with different variations have been described hereabove. It should be noted that those skilled in the art may combine various elements of these various embodiments and variations without showing any inventive step. Further, the practical implementation of the present invention based on the functional indications given hereabove is within the abilities of those skilled in the art, be it for a hardware or software implementation. 
     In particular, the selection of thresholds n 1  and n 2  used for the tests preceding the Miller-Rabin test depends on the application and on the time that can be dedicated to the Miller-Rabin test during the prime number generation. For example, although it is preferable for the sieve table not to be based on the prime numbers smaller than the first threshold to spare calculations, this is not required. 
     Further, the selection of the sizes of the random quantities is adapted according to the sizes desired for prime numbers p and q, and thus for the modulo n of the modular exponentiations of the RSA algorithm. 
     Moreover, although the present invention has been described in relation with a method implementing a single sieve table, it can be envisaged to use several sieve tables by interposing the primality test (steps  34  and  35 ) of each table before the next table, each table having the function of verifying the primality of the candidate number against prime numbers in contiguous ranges defined by successive thresholds. Such a variation may be used, for optimization purposes, to only update a table if the primality test based on the previous table is validated. 
     Of course, the present invention is likely to have various alterations, modifications and improvements which will readily occur to those skilled in the art. Such alterations, modifications, and improvements are intended to be part of this disclosure, and are intended to be within the spirit and the scope of the present invention. Accordingly, the foregoing description is by way of example only and is not intended to be limiting. The present invention is limited only as defined in the following claims and the equivalents thereto.