METHOD FOR PROCESSING A GENERALIZED GOLDWASSER-MICALI CIPHERTEXT, CORRESPONDING ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT

Abstract

In one embodiment, it is proposed a method for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key, said method being executed on an electronic device and being remarkable in that it comprises:—determining at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said determining being a function of—said ciphertext, —an element of said public key, —a private key associated to said public key, —an element defined as a function of said private key, and —least significant bits of said plaintext from position zero to position j−1 in said binary representation.

Description

FIELD OF THE INVENTION

The invention relates to cryptography, and more precisely to homomorphic cryptographic schemes.

BACKGROUND OF THE INVENTION

This section is intended to introduce the reader to various aspects of art, which may be related to various aspects of the present invention that are described and/or claimed below. This discussion is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present invention. Accordingly, it should be understood that these statements are to be read in this light, and not as admissions of prior art.

Additively homomorphic schemes (that enable given only a public-key and the encryption of two messages m₁ and m₂, one can compute the encryption of (m₁+m₂)) are cryptographic functions that enable the design of more complex cryptographic systems. For example, currently, many e-voting schemes employ an additive homomorphic encryption algorithm to encrypt the votes and exploit the additive homomorphism of the encryption algorithm to recover the sum of all votes for any candidate or choice with a single decryption. As no single vote is decrypted, vote privacy is protected. Additive homomorphic schemes can also be used in MPC (for Multi-Party Computation) protocols. At last, other application of additive homomorphic can be found out in the article “Fingerprinting protocol for images based on additive homomorphic property” by M. Kuribayashi et al., and published in the IEEE Trans. Image Process. 2005, or in the article “Application of homomorphism to secure image sharing” by N. Islam et al., published in the journal Optics Communications (Volume 284, Issue 19, 1 September 2011, Pages 4412-4429).

However, only few additively homomorphic schemes exist in the state of the art. Indeed, one skilled in the art has a limited choice of using an additively homomorphic shemes among the original Goldwasser-Micali cryptosystem (see the article “Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information”, by S. Goldwasser and S. Micali, published in the proceedings of STOC'82, pp. 365-377, 1982), Benaloh's construction, the Naccache-Stern scheme, Paillier's cryptosystem scheme, the Boneh-Goh-Nissim (BGN) scheme, the Damgard-Jurik scheme, the additively homomorphic ElGamal cryptosystem scheme, the Okamoto-Uchiyama cryptosystem scheme and the generalized Goldwasser-Micali cryptosystem scheme (published in the article “Efficient Cryptosystems from 2̂-th Power Residue Symbols” by M. Joye and B. Libert, published in the proceedings of Eurocrypt 2013, Lecture Notes in Computer Science vol. 7881, pp. 76-92, 2013).

Therefore, one skilled in the art has to choose one of these schemes according to several criteria such as the size of the data (keys, messages), the security level required, the speed of execution of the additively homomorphic schemes, etc.

The present document focuses on the generalized Goldwasser-Micali cryptosystem scheme, and aims to provide a technique that enables an electronic device to speed up the decryption process of the generalized Goldwasser-Micali cryptosystem.

One skilled in the art could also apply the teaching of the present document to the context described in the article “An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication” by J. Bringer et al., in the proceedings of the conference ACISP'07 (Australasian Conference on Information Security and Privacy), or also in the context of aggregator of time series data as mentioned in the article “A scalable scheme for privacy-preserving aggregation of time-series data”by M. Joye and B. Libert, published in the proceedings of the conference Financial Cryptography and Data Security 2013.

SUMMARY OF THE INVENTION

A first aspect of the present invention is directed to a method for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained by use of a public key. Such method is executed on an electronic device and is remarkable in that it comprises:

• • determining at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said determining being a function of
  • said ciphertext,
  • a first element comprised in said public key,
  • a private key associated to said public key,
  • a second element defined as a function of said private key, and
  • least significant bits of said plaintext from position zero to position j−1 in said binary representation.

In a preferred embodiment, the method is remarkable in that said determining is performed for all the bits of said binary representation of said plaintext having a position different from zero.

In a preferred embodiment, the method is remarkable in that it comprises obtaining said least significant bit of said binary representation of said plaintext as a function of said ciphertext, and said second element defined as a function of said private key.

In a preferred embodiment, the method is remarkable in that said binary representation of said plaintext is a k-bit string, k being an integer greater or equal to one, and in that said second element defined as a function of said private key corresponds to λ_j+1=2^k−(j+1) p′, where p′ is an odd integer linked to said private key p, which is a prime number, by the following equation: p=2^k p′+1.

In a preferred embodiment, the method is remarkable in that said determining of said at least one bit positioned at j-th position of said binary representation of said plaintext comprises determining a first value

${\left(\frac{c}{y^{m\mathrm{mod}2^j}}\right)}^{{\lambda }_{j+1}},$

• whnere c corresponds to said ciphertext, y corresponds to said first element comprised in said public key, and comparing said first value with 1 or p−1.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least a second value D corresponding to y^−p′ mod p, where mod is a modular reduction.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least i values, i being comprised between 1 and j, defined as a function of said at least second value D.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least i values, i being comprised between 1 and k−1, defined as a function of said at least second value D.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least a third value {tilde over (D)} corresponding to y^p′ mod p, where mod is a modular reduction.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least i values, i being comprise between 1 and j, defined as a function of said at least third value {tilde over (D)}.

In a preferred embodiment, the method is remarkable in that said determining said first value comprises obtaining at least i values, i being comprise between 1 and k−1, defined as a function of said at least third value {tilde over (D)}.

In a preferred embodiment, the method is remarkable in that it comprises determining said private key p from said odd integer p′, said odd integer p′ being stored on a memory unit of said electronic device.

In a preferred embodiment, the method is remarkable in that said binary representation is stored on said electronic device according to big-endian rule.

In a preferred embodiment, the method is remarkable in that said binary representation is stored on said electronic device according to little-endian rule.

According to an exemplary implementation, the different steps of the method are implemented by a computer software program or programs, this software program comprising software instructions designed to be executed by a data processor of a relay module according to the disclosure and being designed to control the execution of the different steps of this method.

Consequently, an aspect of the disclosure also concerns a program liable to be executed by a computer or by a data processor, this program comprising instructions to command the execution of the steps of a method as mentioned here above.

This program can use any programming language whatsoever and be in the form of a source code, object code or code that is intermediate between source code and object code, such as in a partially compiled form or in any other desirable form.

The disclosure also concerns an information medium readable by a data processor and comprising instructions of a program as mentioned here above.

The information medium can be any entity or device capable of storing the program. For example, the medium can comprise a storage means such as a ROM (which stands for “Read Only Memory”), for example a CD-ROM (which stands for “Compact Disc—Read Only Memory”) or a microelectronic circuit ROM or again a magnetic recording means, for example a floppy disk or a hard disk drive.

Furthermore, the information medium may be a transmissible carrier such as an electrical or optical signal that can be conveyed through an electrical or optical cable, by radio or by other means. The program can be especially downloaded into an Internet-type network.

Alternately, the information medium can be an integrated circuit into which the program is incorporated, the circuit being adapted to executing or being used in the execution of the method in question.

According to one embodiment, an embodiment of the disclosure is implemented by means of software and/or hardware components. From this viewpoint, the term “module” can correspond in this document both to a software component and to a hardware component or to a set of hardware and software components.

A software component corresponds to one or more computer programs, one or more sub-programs of a program, or more generally to any element of a program or a software program capable of implementing a function or a set of functions according to what is described here below for the module concerned. One such software component is executed by a data processor of a physical entity (terminal, server, etc.) and is capable of accessing the hardware resources of this physical entity (memories, recording media, communications buses, input/output electronic boards, user interfaces, etc.).

Similarly, a hardware component corresponds to any element of a hardware unit capable of implementing a function or a set of functions according to what is described here below for the module concerned. It may be a programmable hardware component or a component with an integrated circuit for the execution of software, for example an integrated circuit, a smart card, a memory card, an electronic board for executing firmware etc.

A further aspect of, the present invention is directed to an electronic device for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key. The electronic device is remarkable in that it comprises:

• • means for determining at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said means for determining being able to determine a function of
  • said ciphertext,
  • a first element comprised in said public key,
  • a private key associated to said public key,
  • a second element defined as a function of said private key, and
  • least significant bits of said plaintext from position zero to position j−1 in said binary representation.

In a preferred embodiment, the electronic device is remarkable in that said means for determining are used for obtaining all the bits of said binary representation of said plaintext having a position different from zero.

BRIEF DESCRIPTION OF THE FIGURES

The above and other aspects of the invention will become more apparent by the following detailed description of exemplary embodiments thereof with reference to the attached drawings in which:

FIG. 1 presents a flowchart that depicts a decryption method according to a first embodiment of the invention;

FIG. 2 presents a flowchart that depicts a decryption method according to a second embodiment of the invention;

FIG. 3 presents a flowchart that depicts a decryption method according to a third embodiment of the invention;

FIG. 4 presents a flowchart that depicts a decryption method according to a fourth embodiment of the invention;

FIG. 5 presents a flowchart that depicts a decryption method according to a fifth embodiment of the invention;

FIG. 6 presents an example of a device that can be used to perform one or several steps of methods disclosed in the present document.

DETAILED DESCRIPTION

The present paragraph is aimed at reminding the reader with the generalized Goldwasser-Micali cryptosystem proposed by Joye and Libert (see the previous mentioned article “Efficient Cryptosystems from 2^k-th Power Residue Symbols” by M. Joye and B. Libert, Eurocrypt 2013, Lecture Notes in Computer Science vol. 7881, pp. 76-92, 2013).

Let N=pq, where p and q are prime numbers, verifying the following relationships p≡1 mod 2^k and q≡1 mod 2^k, with the parameter k which is the size (in bits) of the message to be encrypted. Indeed, the message space is {0,1}^k. Let also y ∈_N\_N, where _N is a multiplicative group of integers belonging to _N* whose Jacobi symbol is 1, and _N is the set of the quadratic residues modulo N. The public key is pk={N,y,k} while the private key is sk={p}. Given a message m=Σ_i=0^k−1 m_i2ⁱ, with m_i ∈ {0,1}, the corresponding ciphertext is formed as c≡y^mx^2k mod N for some random element x ∈_N*. Let's focus now on the decryption process of the generalized Goldwasser-Micali cryptosystem. The plaintext message m is recovered from the ciphertext c as the unique integer in the interval [0, 2^k) satisfying the relationship

${\left[{\left(\frac{y}{p}\right)}_{2^k}\right]}^m\equiv {\left(\frac{c}{p}\right)}_{2^k}\mathrm{mod}p,$

• where the notation

${\left(\frac{a}{p}\right)}_n$

• for values α,p,n
• corresponds to the n-th power residue symbol of a modulo p defined as follow:

${\left(\frac{a}{p}\right)}_n=a^{\frac{p-1}{n}}\mathrm{mod}p.$

• The determination of the plaintext based on the previously mentioned relationship can be done with a variation of the Pohlig-Hellman algorithm (published in the article “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, by S. Pohlig and M. Hellman, in IEEE Trans. on Information Theory, n°24, vol 1, pp. 106-110, 1978). For example, in a step referenced 101, the electronic device initializes several variables (associated with memory units such as registers for example) M, B, C, i and Y as follows: M←0; B←1; C←c; i←1 and Y←y. Then, until the value of the variable i is strictly greater than k+1, the following computation and assignments of variables are performed:

$z\leftarrow \left(\frac{c}{p}\right)2^i;$ $t\leftarrow {\left(\frac{y}{p}\right)}_{2^i};$

• if the values of the variables z and t are different, then the variable M is updated in such way M←M+B; and the variables B and i are updated: B←2B; and i←i+1. When the value of the variable i is strictly greater than k+1, the variable M comprises the expected plaintext m.

The decryption process in the generalized Goldwasser-Micali cryptosystem requires evaluating several power residue symbols modulo a prime number p; namely,

${\left(\frac{c}{p}\right)}_{2^j}=c^{\frac{p-1}{2^j}}\mathrm{mod}p$ ${\mathrm{and}\left(\frac{y}{p}\right)}_{2^j}=y^{\frac{p-1}{2^j}}\mathrm{mod}p.$

As a result, the original decryption algorithm requires 2k exponentiations modulo p. The present invention suggests a modification that considerably speeds up the decryption. It should be noticed that the encryption process is unchanged.

More precisely, the proposed technique is based on a relationship that links a bit representation of the plaintext, at position j−1 (the least significant bit being at position 0, and corresponding to the bit m₀, and the bit at position j−1 corresponding to m_j−1, for 1≦j≦k−1), and some values. More precisely, the relationship is the following one:

(c/y^{m mod2j−1})^λj≡(−1)^mj−1 mod p

• where the ciphertext c is obtained through the use of the encryption function of the generalized Goldwasser-Micali cryptosystem (e.g. the ciphertext is obtained as c=y^mx^2k mod N where the message (or plaintext) is m=Σ_i=0^k−1 m_i2ⁱ, with m_i ∈ {0,1} for each i, N=pq, where p and q are large prime numbers that fulfill the following properties p≡1 mod 2^k, q≡1 mod 2^k, and p≢1 mod 2^k+1, q≢1 mod 2^k+1, an element of the public key y ∈\_N) and for 1≦j≦k , we set up λ_j=2^k−j p′, with p′ being an odd integer defined such that p=2^kp′+1 (such relation is verified as it is equivalent to p ≡1 mod 2^k).

In order to detail how to establish the previous mentioned equation, it should be noticed that we have the following equation that is verified y^2k−1_p′≡−1 mod p. Indeed, we have

$y^{2^{k-1}p^{\prime }}=y^{\left(p-1\right)/2}=\left(\frac{y}{p}\right)\equiv -1\mathrm{mod}p.$

• Then, by setting up C_j≡c^λj mod p, we have C_j≡(y^mx^2k)^λj≡y^m2k−j_p′≡y^{(m mod 2j}₎₂^k−j_p′.
• Therefore, C_j≡y^{(mj−12j−1}+Σ_i=0^j−2m_iⁱ₎₂^k−j_p′≡y^mj−12k−1_p′y^{m mod 2j−1}₎₂^k−j_p′. by applying the previously mentioned equation in the previous paragraph, we obtain
• C_j≡(−1)^mj−1y^{(m mod 2k−j}_p′. Thus, C_j≡(−1)^mj−1y^{(m mod 2j−1}₎λ_j mod p. Hence, the relationship is established.

FIG. 1 presents a flowchart that depicts a decryption method according to a first embodiment of the invention.

In such embodiment of the invention, the decryption method executed on an electronic device obtains a parameter k corresponding to the size (in number of bits) of the plaintext to be recovered, a secret element p′ as previously mentioned, as well as a value D corresponding to the value y^−p′ mod p, and a ciphertext c (such ciphertext being generated through the use of an encryption function in the generalized Goldwasser-Micali cryptosystem). The obtaining of these elements can be done for example by reading in a memory unit the requested values. In a variant, only the secret element p′ is obtained, and the value D is determined from the value of the public element y, that can be stored in a memory of the electronic device, or received from another electronic device. In another variant, the secret element p′ is obtained from the secret element p. In another variant, the secret element p is obtained from the secret element p′.

Then, in a step referenced 101, the electronic device initializes several variables (associated with memory units such as registers for example). Indeed, the variables M, B, U are initialized as follows: M←0; B←1 and U←D.

In a step referenced 102, a variable C is initialized by performing an exponentiation, modulo the secret prime number p, on the ciphertext with an exponent corresponding to the secret element p′ (e.g. we have C←c^p′ mod p) Moreover, a variable (a counter variable), noted i is initialized to 1 (e.g. i←1).

In a step referenced 103, a comparison between the value of the variable i and the parameter k is done. If the value of the variable i is smaller or equal to the value of parameter k, then the steps referenced 104, 105 and 106 are executed. If the value of the variable i is strictly greater than the value of k, then the variable M is outputted, and the decryption method is ended up. Indeed, the variable M comprises in that case the value of the plaintext m.

In a step referenced 104, an intermediate variable z is assigned with the value of the following element: (C. U^M)^2k−i mod p.

In a step referenced 105, the value of the intermediate variable z is compared with one.

If the value of the intermediate variable z is different from one, then the value of the variable M is modified as follows: M←M+B.

In a step referenced 105, the variable B is updated as follows: B←2B, and an increment operation by one of the value of the variable i is performed (e.g. i←i+1). Then, the process returns to the step 103.

FIG. 2 presents a flowchart that depicts a decryption method according to a second embodiment of the invention.

More precisely, by remarking that variable M in the loop of the decryption method described in the FIG. 1 contains the lowest part of the plaintext m, and that one bit of plaintext m is correctly obtained per iteration, there is no need to recompute U^M mod p. Rather, it suffices to update it using the variable C as an accumulator. Further, it is also possible to save a couple of operations by reducing the length of the loop process.

In the decryption method according to such second embodiment of the invention, the same inputs as the one described in FIG. 1 are obtained (and the same remarks are relevant regarding the number of these inputs). The method according to such embodiment comprises a step referenced 201, in which the electronic device initializes several variables (associated with memory units such as registers for example). Indeed, the variables M, B, U are initialized as follows: M←0; B←1 and U←D.

Then, in a step referenced 202, a variable C is initialized by performing an exponentiation, modulo the secret prime number p, on the ciphertext with an exponent corresponding to the secret element p′ (e.g. we have C←c ^P′ mod p). Moreover, a variable (a counter variable), noted i is initialized to 1 (e.g. i←1).

In a step referenced 203, a comparison between the value of the variable i and the value k−1 is performed. If the value of the variable i is smaller or equal to the value k−1, then the steps referenced 204, 205 and 206 are executed. If the value of the variable i is strictly greater than the value k−1, then a step referenced 207 is executed. Such step 207 comprises comparing the value of the variable C with one. If the value of the variable C is different from one, then the variable M is modified as follows: M←M+B. Otherwise, the variable M is not modified. Then, the variable M is outputted, and the decryption method is ended up. Indeed, the variable M comprises in that case the value of the plaintext m.

In a step referenced 204, an intermediate variable z is affected with the value of the following element: C²k−i mod p.

In a step referenced 205, the value of the intermediate variable z is compared with one. If the value of the intermediate variable z is different from one, then the value of the variable M is modified as follows: M ←<M+B, and the value of the variable C is also modified as follows: C←C. U mod p.

In a step referenced 205, the variable B is updated as follows: B←2B, the variable U is updated as follows U←U² mod p, and an increment operation by one of the value of the variable i is performed (e.g. i←i+1). Then the process returns to the step 203.

As already mentioned previously, the value D can be precomputed or included in the private key.

FIG. 3 presents a flowchart that depicts a decryption method according to a third embodiment of the invention.

In such embodiment of the invention, the decryption method can be executed faster (due to the fact that such method uses less operations from a complexity point of view) than the previous ones. However, such method needs in input some additional values (or data). Indeed, in addition to the parameter k, the secret element p′, and the value D, it is necessary to also obtain some other values obtained in function of the value D. More precisely, the method comprises obtaining the values D[j]=D^2j−1 mod p, for 1≦j≦k−1.

The method according to such embodiment comprises a step referenced 301, in which the electronic device initializes several variables (associated with memory units such as registers for example). Indeed, the variables M and B are initialized as follows: M←B←1.

Then, in a step referenced 302, some intermediate variables U_j are initialized as follows: U_j←D[j]=D^2j−1 mod p, for 1≦j≦k−1.

In a step referenced 303, a variable C is initialized in the same way as in the step 202 (e.g. we have C←C^p′ mod p), and a counter variable i is also initialized as follows: i←1.

In a step referenced 304, a comparison between the variable i and the variable k−1 is performed. If the value of the variable i is smaller or equal to the value k−1, then the steps referenced 305, 306 and 307 are executed. If the value of the variable i is strictly greater than the value k−1, then a step referenced 308 is executed. Such step 308 comprises comparing the value of the variable C with one. If the value of the variable C is different from one, then the variable M is modified as follows: M←M+B. Otherwise, the variable M is not modified. Then, the variable M is outputted, and the decryption method is ended up. Indeed, the variable M comprises in that case the value of the plaintext m.

In a step referenced 305, an intermediate variable z is affected with the value of the following element: C^2k−i mod p.

In a step referenced 306, the value of the intermediate variable z is compared with one. If the value of the intermediate variable z is different from one, then the value of the variable M is modified as follows: M←M+B, and the value of the variable C is also modified as follows: C←C. U_i mod p.

In a step referenced 307, the variable B is updated as follows: B←2B, and an increment operation by one of the value of the variable i is performed (e.g. i←i+1). Then the process returns to the step 304.

FIG. 4 presents a flowchart that depicts a decryption method according to a fourth embodiment of the invention.

In such embodiment, the different values of C^2k−i mod p mentioned in the previous embodiments are obtained before executing the loop corresponding to the evolution of the value of the variable i.

In such embodiment of the invention, the decryption method executed on an electronic device obtains the parameter k, the secret element p′ as previously mentioned, as well as a value {tilde over (D)} corresponding to the value y^p′ mod p (e.g. we have {tilde over (D)}=D⁻¹ mod p), and the ciphertext c. The obtaining of these elements can be done for example by reading in a memory unit the requested values. In a variant, only the secret element p′ is obtained, and the value {tilde over (D)} is determined from the value of the public element y, that can be stored in a memory of the electronic device, or received from another electronic device. In another variant, the secret element p′ is obtained from the secret element p. In another variant, the secret element p is obtained from the secret element p′.

The method according to such embodiment comprises a step referenced 401, in which the electronic device initializes several variables (associated with memory units such as registers for example). Indeed, the variables M, A, B, U are initialized as follows: M←0; A←1, B←1 and U←{tilde over (D)}.

Then, in a step referenced 402, a variable C₀ is initialized by performing an exponentiation, modulo the secret prime number p, on the ciphertext with an exponent corresponding to the secret element p′ (e.g. we have C₀←c^p′ mod p).

Then, in a step referenced 403, some intermediate variables C_j are initialized as follows: C_j←C_j−1²mod p, for 1≦j≦k−1.

In a step referenced 404, a counter variable i is initialized as follows: i←1.

In a step referenced 405, a comparison between the variable i and the value k−1 is performed. If the value of the variable i is smaller or equal to the value k−1, then the steps referenced 406 and 407 are executed. If the value of the variable i is strictly greater than the value k−1, then a step referenced 408 is executed. Such step 408 comprises comparing the value of the variable A with the value of the variable C₀. If the value of the variable A is different from the value of the variable C₀, then the variable M is modified as follows: M←M+B. Otherwise, the variable M is not modified. Then, the variable M is outputted, and the decryption method is ended up. Indeed, the variable M comprises in that case the value of the plaintext m.

In a step referenced 406, the value of the variable A is compared with the one of the variable C_k−i. If these value are different from each other, then the value of the variable M is modified as follows: M←M+B, and the value of the variable A is also modified as follows: A←A. U mod p.

In a step referenced 407, the variable B is updated as follows: B←2B, the variable U is updated as follows: U←U² mod p, and an increment operation by one of the value of the variable i is performed (e.g. i←i+1). Then the process returns to the step 405.

By determining the value {tilde over (D)} and C_j in such way, the method according to this embodiment has a cubic complexity (whereas the classical decryption method has a quartic complexity).

FIG. 5 presents a flowchart that depicts a decryption method according to a fifth embodiment of the invention.

Such embodiment of the invention uses the technique described in the FIG. 3 to the one described in FIG. 4.

Indeed, in addition to the parameter k, the secret element p′, and the value {tilde over (D)}, it is necessary to also obtain some other values obtained in function of the value {tilde over (D)}. More precisely, the method comprises obtaining the values {tilde over (D)}[j]={tilde over (D)}^2j−1 mod p, for 1≦j≦k−1.

The method according to such embodiment comprises a step referenced 501, in which the electronic device initializes several variables (associated with memory units such as registers for example). Indeed, the variables M, A, B are initialized as follows: M←0; A←1, B←1.

Then, in a step referenced 502, some intermediate variables U_j are initialized as follows: U_j←{tilde over (D)}[j]≡{tilde over (D)}hu 2^j−1 mod p, for 1≦j≦k−1.

Then, in a step referenced 503, a variable C₀ is initialized by performing an exponentiation, modulo the secret prime number p, on the ciphertext with an exponent corresponding to the secret element p′ (e.g. we have C₀←c^p′ mod p).

Then, in a step referenced 504, some intermediate variables C_j are initialized as follows: C_j←C_j−1²mod p, for 1≦j≦k−1.

In a step referenced 505, a counter variable i is initialized as follows: i←1.

In a step referenced 506, a comparison between the value of the variable i and the value k−1 is performed. If the value of the variable i is smaller or equal to the value k−1, then the steps referenced 507 and 508 are executed. If the value of the variable i is strictly greater than the value k−1, then a step referenced 509 is executed. Such step 509 comprises comparing the value of the variable A with the value of the variable C₀. If the value of the variable A is different from the value of the variable C₀, then the variable M is modified as follows: M←M+B. Otherwise, the variable M is not modified. Then, the variable M is outputted, and the decryption method is ended up. Indeed, the variable M comprises in that case the value of the plaintext m.

In a step referenced 507, the value of the variable A is compared with the one of the variable C_k−i. If these value are different from each other, then the value of the variable M is modified as follows: M←M+B, and the value of the variable A is also modified as follows: A←A. U_i mod p.

In a step referenced 508, the variable B is updated as follows: B←2B, and an increment operation by one of the value of the variable i is performed (e.g. i←i+1). Then the process returns to the step 506.

By determining the values {tilde over (D)}[j] and C_j in such way, the method according to this embodiment has also a cubic complexity (whereas the classical decryption method has a quartic complexity).

FIG. 6 presents an example of a device that can be used to perform one or several steps of methods disclosed in the present document.

Such device referenced 600 comprises a computing unit (for example a CPU, for “Central Processing Unit”), referenced 601, and one or more memory units (for example a RAM (for “Random Access Memory”) block in which intermediate results can be stored temporarily during the execution of instructions a computer program, or a ROM block in which, among other things, computer programs are stored, or an EEPROM (“Electrically-Erasable Programmable Read-Only Memory”) block, or a flash block) referenced 602. Computer programs comprise instructions that can be executed by the computing unit. Such device 600 can also comprise a dedicated unit, referenced 603, constituting an input-output interface to allow the device 600 to communicate with other devices. In particular, this dedicated unit 603 can be connected with an antenna (in order to perform communication without contacts), or with serial ports (to carry communications “contact”). It may be noted that the arrows in FIG. 6 signify that the linked unit can exchange data through buses for example together.

In an alternative embodiment, some or all of the steps of the method previously described, can be implemented in hardware in a programmable FPGA (“Field Programmable Gate Array”) component or ASIC (“Application-Specific Integrated Circuit”) component. In an alternative embodiment, some or all of the steps of the method previously described, can be executed on an electronic device comprising memory units and processing units as the one disclosed in the FIG. 6.

Claims

1. A method for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key, said method being executed on an electronic device and said method comprising: determining at least one bit of a binary representation of a plaintext associated withsaid ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said determining being a function ofsaid ciphertext,a first element comprised in said public key,a private key associated with said public key,a second element defined as a function of said private key, andleast significant bits of said plaintext from position zero to position j−1 in said binary representation.

2. The method according to claim 1, wherein said determining is performed for all the bits of said binary representation of said plaintext having a position different from zero.

3. The method according to claim 1, wherein said method comprises obtaining said least significant bit of said binary representation of said plaintext as a function of said ciphertext, and said second element defined as a function of said private key.

4. The method according to claim 1, wherein said binary representation of said plaintext is a k-bit string, k being an integer greater or equal to one, and in that said second element defined as a function of said private key corresponds to λj+1=2k−(j+1)p′where p′ is an odd integer linked to said private key p, which is a prime number, by the following equation: p=2k p′+1.

5. The method according to claim 4, wherein said determining of said at least one bit positioned at j-th position of said binary representation of said plaintext comprises determining a first value

6. The method according to claim 5, wherein said determining said first value comprises obtaining at least a second value D corresponding to y−p′ mod p, where mod is a modular reduction.

7. The method according to claim 6, wherein said determining said first value comprises obtaining at least i values, i being comprised between 1 and j, defined as a function of said at least second value D.

8. The method according to claim 2, wherein said determining said first value comprises obtaining at least i values, i being comprised between 1 and k−1, defined as a function of said at least second value D.

9. The method according to claim 5, wherein said determining said first value comprises obtaining at least a third value {tilde over (D)} corresponding to yp′ mod p, where mod is a modular reduction.

10. The method according to claim 9, wherein said determining said first value comprises obtaining at least i values, i being comprise between 1 and j, defined as a function of said at least third value {tilde over (D)}.

11. The method according to claim 2, wherein said determining said first value comprises obtaining at least i values, i being comprised between 1 and k−1, defined as a function of said at least third value {tilde over (D)}.

12. The method according to claim 4, wherein said method comprises determining said private key p from said odd integer p′, said odd integer p′ being stored on a memory unit of said electronic device.

13. The method according to claim 1, wherein said binary representation is stored on said electronic device according to big-endian rule.

14. The method according to claim 1, wherein said binary representation is stored on said electronic device according to little-endian rule.

15. A computer-readable and non-transient storage medium storing a computer program comprising a set of computer-executable instructions to implement a method for processing a generalized Goldwasser-Micali ciphertext when the instructions are executed by a computer, wherein the instructions comprise instructions, which when executed, configure the computer to perform a method for processing for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key, said method being executed on an electronic device and said method comprising: determining at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, i being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said determining being a function ofsaid ciphertext,a first element comprised in said public key,a private key associated with said public key,a second element defined as a function of said private key, andleast significant bits of said plaintext from position zero to position j−1 in said binary representation.

16. An electronic device for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key, said electronic device being characterized in that it comprises at least one processor configured to determine at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j-th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said at least one processor being configured to determine said at least one bit based on: said ciphertext,a first element comprised in said public key,a private key associated to said public key,a second element defined as a function of said private key, andleast significant bits of said plaintext from position zero to position j−1 in said binary representation.

17. The method according to claim 6, wherein said determining said first value comprises obtaining at least i values, i being comprised between 1 and k−1, defined as a function of said at least second value D.

18. The method according to claim 9, wherein said determining said first value comprises obtaining at least i values, i being comprised between 1 and k−1, defined as a function of said at least third value {tilde over (D)}.