Cryptographic system and method with fast decryption

<u style="single">TECHNICAL FIELD</u>

This invention relates to cryptographic systems, computers, and computer-implemented methods for performing encryption and decryption operations. More particularly, this invention relates to a cryptographic system that improves the speed at which decryption operations are performed.

<u style="single">BACKGROUND OF THE INVENTION</u>

Public key cryptography is a widely used approach for securely transmitting messages over an otherwise unsecured communications channel. Public-key cryptography employs asymmetric key pairs. An "asymmetric" cryptographic key pair consists of two separate keys, a first key to manipulate data in one way and a second key to convert the manipulated data back to its original form. The keys are based upon a mathematical relationship in which one key cannot be calculated (at least in any reasonable amount of time) from the other key.

Cryptographic key pairs can be used for different functions, such as encryption, decryption, digital signing, signature verification, and authentication. As an example, encryption and decryption using an asymmetric key pair can be represented as follows: <maths id="math0001" num=""><math display="block"><mrow><msub><mrow><mi mathvariant="normal">E</mi></mrow><mrow><mi mathvariant="normal">Kpub</mi></mrow></msub><mrow><mo>(</mo><mi mathvariant="normal">M</mi><mo>)</mo><mo>=</mo><mi mathvariant="normal">C</mi></mrow></mrow></math><img file="EP1031204B1_D0001.tif" /></maths><maths id="math0002" num=""><math display="block"><mrow><msub><mrow><mi mathvariant="normal">D</mi></mrow><mrow><mi mathvariant="normal">Kpri</mi></mrow></msub><mrow><mo>(</mo><mi mathvariant="normal">C</mi><mo>)</mo><mo>=</mo><mi mathvariant="normal">M</mi></mrow></mrow></math><img file="EP1031204B1_D0002.tif" /></maths> where "E_Kpub" is an encryption function using a public encryption key "Kpub" to encrypt a plaintext message "M" into ciphertext "C", and "D_Kpri" is a decryption function using a private decryption key "Kpri". The inverse is also true in that a message can be "signed" using the private key and the signature can be verified using the public key.

In a public key system, the public key is distributed to other parties and the private key is maintained in confidence. The asymmetric public and private keys ensure two results. First, only the holder of the private key can decrypt a message that is encrypted with the corresponding public key. Second, if another party decrypts a message using the public key, that party can be assured that the message was encrypted by the private key and thus originated with presumably the holder of the private key.

One of the best known and most widely used asymmetric ciphers is the RSA cryptographic cipher named for its creators Rivest, Shamir, and Adleman. The original RSA cryptography system is described in U.S. Patent 4,405,829, entitled "Cryptographic Communications System and Method", which was filed September 20, 1983, in the names of Rivest, Shamir, and Adleman.

Other prior art includes: "Advances in Cryptography, 17^th Annual International Cryptography Conference Proceedings, page 372 to 384 'Fast-RSA-Type Cryptosystems Using N-Adic Expansion', by Tsuyoshi Takagi, published on 17 August 1997, which discloses two RSA cryptosystems that are n-adic expansions, where n is the public key.

Another prior art document is "Electronics Letters, Volume 18, No. 21, pages 905 to 907 'Fast Decipherment Algorithm for RSA Public-Key Cryptosystem'" by J-J Quisquater and C. Couvreur, published on 27 August 1982, which discloses a method that uses a fast algorithm for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman, as disclosed in U.S. 4,405,829, referred to above. The method is based on the Chinese remainder theorem and on improved modular multiplication algorithms.

The RSA cipher for encryption and decryption is given as follows: <ul id="ul0001" list-style="none" compact="compact"><li>RSA Encryption: C = M^e mod n</li><li>RSA Decryption: M = C^{1/e mod(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)} mod n</li></ul> where p₁ and p₂ are prime numbers, n is a composite number of the form n = p₁ p₂, and e is a number relatively prime to (p₁-1)(p₂-1).

The operation "mod" is a "modular reduction" operation, or simply "modulo" operation, which is a common operation for large integer arithmetic. The modulo operation is an arithmetic operation whose result is the remainder of a division operation. It is expressed as "A mod B", where A is a number written in some base and B is the "modulus". The result of A mod B is the remainder of the number A divided by the modulus B. As a simple example, the modulo operation 17 mod 3 yields a result of 2, because 17 divided by 3 yields a remainder of 2. Because it produces a remainder, the modulo operation is often alternatively referred to as the "division remainder" operation.

With the conventional RSA cryptography, decryption is significantly slower than encryption. This discrepancy is due to the fact that the RSA cipher requires more computations to decrypt a message than are needed to encrypt the same message. The discrepancy can be disadvantageous in certain environments. For example, in the client server context, clients and servers often exchange encrypted messages to one another. Individual clients often enjoy plentiful time and resources to encrypt a message. Unfortunately, the server does not experience such luxury and may on occasions be limited in its ability to rapidly decrypt incoming messages, especially during times of high client request volume.

Accordingly, there is a need to improve the speed of the decryption in the RSA algorithm.

<u style="single">SUMMARY OF THE INVENTION</u>

This invention concerns a cryptography system and method that improves the decryption speed in the RSA cipher. The cryptography system employs a new family of trapdoor permutations based on exponentiation in subgroups of Z_n*.

In a first aspect of the invention there is a method for sending messages over a network between first and second computing units, athe method comprising the following steps: (a) encrypting a message M into ciphertext C at the first computing unit, where the ciphertext C includes a value V and a value W, as follows: (l) the value V is a function of a number x, such that V = x^e, where e is an integer and x is as follows: <maths id="math0003" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi><mo>,</mo></mrow></math><img file="EP1031204B1_D0003.tif" /></maths> where: n is a number n = p₁ p₂ where p₁ and p₂ are prime numbers with p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers, and q₁ and q₂ are prime numbers; R is a random number selected independent of the random numbers r₁ and r₂; and g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁, r₂, and R; and the value W is a function of a value h(x) and the message M, the value h(x) being a result of a one-way function of the number x; (b) sending the ciphertext C from the first computing unit to the second computing unit; and (c) decrypting the ciphertext C at the second computing unit to reproduce the message M, where M is a function of the value W and the value h(x) and x is derived as x = V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n.

In a second aspect of the invention there is computer-implemented method for encrypting a message M into ciphertext C wherein: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; and g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)/(p<sub2>2</sub2>-1)/(q<sub2>1</sub2>q<sub2>2</sub2>)}mod n, where r₃ is a random number selected independent of the random numbers r₁, and r₂; the computer-implemented method comprising the following steps: computing a number x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; transforming the number x according to a one-way function h to yield a value h(x); and encoding the message M according to a function of the value h(x).

In a third aspect of the invention there is a computer-implemented method for decrypting ciphertext C to reproduce a message M, wherein: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁ and r₂; x is a number in the form of x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; e is an integer; and V is a value in the form of V = x^e; the computer-implemented method comprising the following steps: recovering the number x from the value V, where x = V^{(1/e)mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n; transforming the number x according to a one-way function h to yield a value h(x); and decoding the ciphertext C according to a function of the value h(x) to recapture the message M.

In a fourth aspect of the invention there is a computer program, or suit of computer programs, arranged such that when executed by a computer it/they control the computer to perform the method of any of the preceding claims.

In a fifth aspect of the invention there is a system for sending messages over a communications channel, comprising: an encoder to transform a message M into ciphertext C and transmit the ciphertext C over the communications channel, where the ciphertext C includes a value V and a value W, as follows: (l) the value V is a function of a number x, such that V = x^e, where e is an integer and x is as follows: <maths id="math0004" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi><mo>,</mo></mrow></math><img file="EP1031204B1_D0004.tif" /></maths> where: <ul id="ul0002" list-style="none" compact="compact"><li>(i) n is a number n = p₁ p₂ where p₁ and p₂ are prime numbers with p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers, and q₁ and q₂ are prime numbers; (ii) is a random number selected independent of the random numbers r₁ and r₂; and (iii) g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁, r₂, and R; and (2) the value W is a function of a value h(x) and the message M, the value h(x) being a result of a one-way function of the number x; and a decoder coupled to receive the ciphertext C and the value V from the communications channel and to transform the ciphertext C back to the message M, where M is a function of the value W and the value h(x) and x is derived as x = V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n.</li></ul>

In a sixth aspect of the invention there is an encoder for a cryptographic system, where: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; and g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q)} mod n, where r₃ is a random number selected independent of the random numbers r₁ and r₂; the encoder comprising: means for computing a number x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; means for transforming the number x according to a one-way function h to yield a value h(x); and means for encoding a message M according to a function of the value h(x),

In a seventh aspect of the invention there is a decoder for a cryptographic system, where: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁ and r₂; x is a number in the form of x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; e is an integer; V is a value in the form of V = x^e; and W is a value derived from a function of a message M and a value h(x), where h(x) is a result of a one-way function h; the decoder comprising means for receiving the values V and W; means for recovering the number x from the value V, where x = V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n; means for transforming the number x according to a one-way function h to yield the value h(x); and means for decoding the value W according to a function of the value h(x) to recapture the message M.

In an eighth aspect of the invention there is a computer-readable medium having computer-executable instructions causing a computer to encrypt a message M to a ciphertext C, where: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; and g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁ and r₂; the computer-readable medium comprising: computer-executable instructions which cause a computer to compute a number x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; computer-executable instructions which cause a computer to transform the number x according to a one-way function h to yield a value h(x); and computer-executable instructions which cause a computer to encode a message M according to a function of the value h(x).

In a ninth aspect of the invention there is computer-readable medium having computer-executable instructions causing a computer to decrypt ciphertext C to recover a message M, where: n is a number in the form n = p₁ p₂, where p₁ and p₂ are prime numbers; p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers and q₁ and q₂ are prime numbers; g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁ and r₂; x is a number in the form of x = g^R mod n, where R is a random number selected independent of the random numbers r₁, r₂, and r₃; e is an integer; and V is a value in the form of V = x^e; the computer-readable medium comprising: computer-executable instructions which cause a computer to recover the number x from the value V, where x = V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>}₂ mod n; computer-executable instructions which cause a computer to transform the number x according to a one-way function h to yield h(x); and computer-executable instructions which cause a computer to decode the ciphertext C according to a function of h(x) to recapture the message M.

A number of preferred or advantageous features are referred to in the dependent claims;

The system disclosed in the description includes an encoder to transfer a message M into ciphertext C and transmit the ciphertext C over a communications channel. The ciphertext C has two components, a value V and a value W. The value V is a function of a number x, or V = x^e, where e is an integer and x is as follows: <maths id="math0005" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi><mo>,</mo></mrow></math><img file="EP1031204B1_D0005.tif" /></maths> where: <ul id="ul0003" list-style="none" compact="compact"><li>(i) n is a number n = p₁ p₂ where p₁ and p₂ are prime numbers with p₁ = r₁ q₁ + 1 and p₂ = r₂ q₂ + 1, where r₁ and r₂ are random numbers, and q₁ and q₂ are prime numbers;</li><li>(ii) R is a random number selected independent of the random numbers r₁ and r₂; and</li><li>(iii) g is a number in the form of g = r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/(q<sub2>1</sub2> q<sub2>2</sub2>)} mod n, where r₃ is a random number selected independent of the random numbers r₁, r₂, and R.</li></ul>

The value W is encoded as a function of a value h₁(x) and the message M (e.g., h₁(x)⊕M), where value h₁(x) is a one-way function of a number x (e.g., a hash function of x).

The encoder disclosed in the description also computes a hash value h₂(x,M) using a hashling function h of the number x and the message M. The encoder sends the ciphertext C (including values V and W) and the hash value h₂(x,M) over the communications channel.

The system disclosed in the description further includes a decoder coupled to receive the ciphertext C and the hash value h₂(x,M) from the communications channel and to transform the ciphertext C back to the message M. The decoder first derives the number x from the value V, as follows x=V^{(1/e)modq<sub2>1</sub2>q<sub2>2</sub2>} mod n. The decoder then decodes the message M using a function of the value W and the value h₁(x) (e.g., W⊕h₁(x)). After recovering the message M, the decoder computes a test hash value h₂'(x, M) from the number x and the recovered messaged M and compares the test hash value h₂'(x,M) from the hash value h₂(x,M) received from the encoder. If the two hash values match, the message M has not been altered.

<u style="single">BRIEF DESCRIPTION OF THE DRAWINGS</u>

<ul id="ul0004" list-style="none" compact="compact"><li>Fig. 1 is a block diagram of a cryptography system.</li><li>Fig. 2 is a block diagram of a computer system that implements the cryptography system.</li><li>Fig. 3 is a flow diagram showing steps in a method for encrypting and decrypting a message.</li></ul>

<u style="single">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT</u>

The following discussion assumes that the reader is familiar with cryptography techniques and modulo operations. For a basic introduction of cryptography, the reader is directed to a text written by Bruce Schneier and entitled, "Applied Cryptography: Protocols, Algorithms, and Source Code in C," second edition, published by John Wiley &amp; Sons with copyright 1996.

Fig. 1 shows a cryptographic system 20 having an encoder 22 coupled to a decoder 24 via a communications channel 26. The cryptographic system 20 is employs an asymmetric cryptographic cipher that is based on the RSA algorithm. More particularly, the preferred system is a Bellare-Rogaway cryptosystem that employs the RSA trapdoor permutation family.

In general, the cryptographic cipher employs a private key consisting of four prime numbers p₁, p₂, q₁, and q₂. The prime numbers are related as follows: <maths id="math0006" num=""><math display="block"><mrow><msub><mrow><mi mathvariant="normal">P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi mathvariant="normal">r</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal">q</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mn>1</mn></mrow></math><img file="EP1031204B1_D0006.tif" /></maths><maths id="math0007" num=""><math display="block"><mrow><msub><mrow><mi mathvariant="normal">P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><msub><mrow><mi mathvariant="normal">r</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi mathvariant="normal">q</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mn>1</mn></mrow></math><img file="EP1031204B1_D0007.tif" /></maths> where r₁ and r₂ are random numbers, constrained by a requirement that their value in the above equations yield prime numbers p₁ and p₂.

A public key is generated from the private key. The public key consists of three numbers n, e, and g. The number e is an integer, and numbers n and g are computed as follows:<maths id="math0008" num=""><math display="block"><mrow><mi mathvariant="normal">n</mi><mo>=</mo><msub><mrow><mi mathvariant="normal">p</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal">p</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math><img file="EP1031204B1_D0008.tif" /></maths><maths id="math0009" num=""><math display="block"><mrow><mi mathvariant="normal">g</mi><mo>=</mo><msup><mrow><msub><mrow><mi mathvariant="normal">r</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mrow><mrow><mo>(</mo><msub><mrow><mi mathvariant="normal">p</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>-</mo><mn>1</mn><mo>)</mo><mrow><mo>(</mo><msub><mrow><mi mathvariant="normal">p</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>-</mo><mn>1</mn><mo>)</mo><mo>/</mo><msub><mrow><mi mathvariant="normal">q</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mrow></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0009.tif" /></maths> where r₃ is a random number that is selected independent of the random numbers r₁ and r₂. The random number r₃ will most likely be different from the random numbers r₁ and r₂, although it need not be. The number g is a random element of Z_n* of order q₁ q₂.

The encoder 22 encodes a message M into a ciphertext C using the public key, which consists of n, e, and g. Broadly speaking, the ciphertext C is a function of the message M and a number x, where x has an order q₁ q₂ in Z_n*. The number x is derived as follows: <maths id="math0010" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0010.tif" /></maths> where R is a random number that is selected independent of the random numbers r₁ and r₂. The random number R will most likely be different from the random numbers r₁ and r₂, although it need not be. The ciphertext C has two components, a value V and a value W. The value V is a function of the number x, as follows: <maths id="math0011" num=""><math display="block"><mrow><mi mathvariant="normal">V</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">x</mi></mrow><mrow><mi mathvariant="normal">e</mi></mrow></msup></mrow></math><img file="EP1031204B1_D0011.tif" /></maths>

The value W is a function of a value h₁(x) and the message M, where the value h₁(x) is a result of a one-way function h₁ of the number x. As one example, the one-way function is implemented as a hash function, such as SHA (Secured Hash Algorithm). In one implementation, the value W is computed using an exclusive OR function, as follows:<maths id="math0012" num=""><math display="block"><mrow><mi mathvariant="normal">W</mi><mo>=</mo><msub><mrow><mi mathvariant="normal">h</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi mathvariant="normal">x</mi><mo>)</mo><mo>⊕</mo><mi mathvariant="normal">M</mi></mrow></mrow></math><img file="EP1031204B1_D0012.tif" /></maths> However, other logical combinations of the value h₁(x) and M may be used in place of the exclusive OR function, as long as the logical operation is reversible.

The encoder 22 packages the values V and W together to form the ciphertext C, and sends it across the communications channel 26 to the decoder 24. The decoder 24 recomputes the number x from the value V using the private key, which consists of the public key plus p₁, p₂, q₁, q₂, as follows: <maths id="math0013" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">V</mi></mrow><mrow><mrow><mo>(</mo><mn>1</mn><mo>/</mo><mi mathvariant="normal">e</mi><mo>)</mo><mrow><mi mathvariant="normal"> mod</mi><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mrow></mrow></msup><mi mathvariant="normal"> mod n</mi><mn>.</mn></mrow></math><img file="EP1031204B1_D0013.tif" /></maths>

Once the number x is recovered, the decoder 24 recaptures the message M from the value W as follows: <maths id="math0014" num=""><math display="block"><mrow><mi mathvariant="normal">M</mi><mo>=</mo><mi mathvariant="normal">W</mi><mo>⊕</mo><mi mathvariant="normal">h</mi><mrow><mo>(</mo><mi mathvariant="normal">x</mi><mo>)</mo><mo>=</mo><mi mathvariant="normal">h</mi><mrow><mo>(</mo><mi mathvariant="normal">x</mi><mo>)</mo><mo>⊕</mo><mi mathvariant="normal">M</mi><mo>⊕</mo><mi mathvariant="normal">h</mi><mrow><mo>(</mo><mi mathvariant="normal">x</mi><mo>)</mo><mo>=</mo><mi mathvariant="normal">M</mi></mrow></mrow></mrow></mrow></math><img file="EP1031204B1_D0014.tif" /></maths>

The cryptographic cipher described above and utilized in system 20 is advantageous in that the decrypting speed is faster as compared to decryption in the standard RSA cipher. The reason for this is that the operation "V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n" used in the recovery of x is significantly faster than a corresponding operation "C^{(1/e) mod (p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)} mod n " used in the traditional RSA cipher.

The improved decryption speed is achieved by employing a new family of trapdoor permutations based on exponentiation in subgroups of Z_n*. The above cryptography cipher takes advantage of a certain subgroup of Z_n*. More particularly, the cipher utilizes subgroups of Z_n*, which are generated by g, to compute the number x. This enables computations on the decryption side that are of order q₁ q₂ in Z_n*.

The cryptographic cipher has a disadvantage in that the encryption process is slower in comparison to encryption in the standard RSA algorithm. This is because the new scheme involves added computations to derive the number x on the encryption side. The number of added computations can be minimized by computing the number x only occasionally, rather than every time. This optimization is discussed below in more detail.

Overall, the cryptographic cipher is approximately equal in speed with the RSA cipher. However, in some contexts, it is beneficial to improve the speed of the decryption process, even if the improvement comes at the cost of slower encryption. In the client-server context, for example, improving decryption speed at the server is a real benefit, even if it comes at the expense of slower encryption at the client. The client has abundant time to encrypt messages and the slower speed should not be noticeable; yet, any improvement in decryption speed at the server would be appreciated.

The Fig. 1 architecture is representative of many different environments in which cryptographic capabilities are used. For instance, in the client-server context, an encoder 22 and decoder 24 might be implemented at both the client and server to enable secure communications over a network, such as a LAN (local area network), a WAN (wide area network), or the Intemet. As another example, in a smart card context, the encoder 22 might be implemented in the smart card and the decoder 24 might be implemented in a communicating agent (e.g., computer, ATM, kiosk, vending machine, custom machine, etc.). Here, the channel 26 represents an electronic interface between the card and the agent.

For purposes of continuing discussion, the cryptographic system 20 will be described as being implemented in general purpose computers, such as personal computers, servers, workstations, laptops, and so forth.

Fig. 2 shows an example implementation of a general purpose computer 30. The computer 30 includes a processing unit 32, a system memory 34, and a system bus 36 that couples various system components including the system memory 34 to the processing unit 32. The system bus 36 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory 34 includes read only memory (ROM) 38 and random access memory (RAM) 40. A basic input/output system 42 (BIOS) is stored in ROM 38.

The computer 30 also has one or more of the following drives: a hard disk drive 44 for reading from and writing to a hard disk, a magnetic disk drive 46 for reading from or writing to a removable magnetic disk 48, and an optical disk drive 50 for reading from or writing to a removable optical disk 52 such as a CD ROM or other optical media. The hard disk drive 44, magnetic disk drive 46, and optical disk drive 50 are connected to the system bus 36 by a hard disk drive interface 54, a magnetic disk drive interface 56, and an optical drive interface 58, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 30.

Although a hard disk, a removable magnetic disk 48, and a removable optical disk 52 are described, it should be appreciated by those skilled in the art that other types of computer readable media can be used to store data. Other such media include magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories (RAMs), read only memories (ROM), and the like.

A number of program modules may be stored on the hard disk, magnetic disk 48, optical disk 52, ROM 38, or RAM 40. These programs include an operating system 60, one or more application programs 62, other program modules 64, and program data 66.

A user may enter commands and information into the personal computer 30 through input devices such as a keyboard 68 and a mouse 70. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 32 through a serial port interface 72 that is coupled to the system bus 36, but may be connected by other interfaces, such as a parallel port, game port, or a universal serial bus (USB).

A monitor 74 or other type of display device is also connected to the system bus 36 via an interface, such as a video adapter 76. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.

The server computer 30 has a network interface or adapter 78, a modem 80, or other means for establishing communications over a network 82 (e.g., LAN, Internet, etc.). The modem 80, which may be internal or external, is connected to the system bus 36 via the serial port interface 72.

The cryptographic system 20 may be implemented in the computer 30 as software, firmware, or hardware. For instance, the encoder 22 and decoder 24 may be implemented within the operating system 60, application programs 62, or program modules 64 (such as a DLL-dynamic linked library). Alternatively, the encoder 22 and decoder 24 may be implemented in ROM 38. In yet another embodiment, the encoder 22 and decoder 24 may be implemented within the processing unit 32.

Fig. 3 shows exemplary steps in a method for encrypting and decrypting messages using the cryptographic system 20. As pictorially represented in Fig. 3, steps 100-106 are performed by the encoder 22 and steps 108-114 are performed by the decoder 24. The encoder 22 knows the public key (i.e., prime numbers n, e, and g) that is derived from the private key. These keys may be stored in memory or registers. The decoder 24 knows the private key (i.e., numbers p₁, p₂, q₁, and q₂).

At step 100, the encoder 22 computes the number x as a function of g, a random element of Z_n* of order q₁ q₂. More particularly, the encoder 22 calculates x as follows: <maths id="math0015" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0015.tif" /></maths> where R is a random number.

At step 102, the encoder encodes the message M to yield a ciphertext C. This encoding involves generating the values V and W, where V=x^e and W=h₁(x)⊕M. The value h₁(x) is a result of a first hash function h₁ of the number x. The ciphertext C consists of the values V and W.

At step 104, the encoder 22 computes another hash value h₂(x, M), which is a result of a second hash function h₂ of the number x and the message M. The decoder 24 uses this hash value to check whether the message M has been altered or otherwise compromised in route between the encoder and decoder. At step 106, the encoder 22 transmits the ciphertext C (i.e., V=x^e and W=h₁(x)⊕M) and second hash value h₂(x, M) over the communications channel 26 to the decoder 24.

At step 108, the decoder 24 receives the ciphertext C and second hash value h₂(x, M). At step 110, the decoder 24 then recomputes the number x from the value V component (i.e., V=x^e) of the ciphertext C, as follows: <maths id="math0016" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">V</mi></mrow><mrow><mrow><mo>(</mo><mn>1</mn><mo>/</mo><mi mathvariant="normal">e</mi><mo>)</mo><mrow><mi mathvariant="normal"> mod</mi><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mrow></mrow></msup><mi mathvariant="normal"> mod n</mi><mn>.</mn></mrow></math><img file="EP1031204B1_D0016.tif" /></maths> Once the number x is recovered, the decoder 24 computes the hash value h₁(x) using the same first hash function h₁ employed by the encoder 22. At step 112, the decoder 24 recovers the message M from the value W component of the ciphertext C, as follows: <maths id="math0017" num=""><math display="block"><mrow><mi mathvariant="normal">M</mi><mo>=</mo><mi mathvariant="normal">W</mi><mo>⊕</mo><msub><mrow><mi mathvariant="normal">h</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi mathvariant="normal">x</mi><mo>)</mo></mrow></mrow></math><img file="EP1031204B1_D0017.tif" /></maths>

At step 114, the decoder 24 takes the recovered number x and the recovered message M and computes a test hash value h₂'(x, M) using the same second hash function h₂ employed by the encoder. If the test hash value h₂'(x, M) equals the hash value h₂(x, M) received from the encoder 22, the decoder 24 is assured that the message M has not been altered.

The above encryption/decryption process can be represented in the following pseudo-code. The key calculation can be performed once, prior to the encryption/decryption steps to establish the key values. The keys can be updated as needed.

Key Calculation

<ul id="ul0005" list-style="none" compact="compact"><li>int e, r₁, r₂, r₃</li><li>prime int p₁, p₂, q₁, q₂</li><li>p₁ ← r₁ q₁ + 1</li><li>p₂ ← r₂ q₂ + 1</li><li>n ← p₁ p₂</li><li>g ← r₃^{(p<sub2>1</sub2>-1)(p<sub2>2</sub2>-1)/q<sub2>1</sub2> q<sub2>2</sub2>} mod n</li></ul>

Encryption

Function E(M, V, W, HV) \*M is an input parameter*\ \*V, W, and HV are output parameters*/ <ul id="ul0006" list-style="none" compact="compact"><li>int R</li><li>x ← g^R mod n</li><li>V ← x^e mod n</li><li>W ← h₁(x)⊕M</li><li>HV ← h₂(x, M)</li></ul> return V, W, HV

Decryption

Function D(V, W, HV, M) \*V, W, and HV are input parameters*\ \*M is the output parameter*\ <ul id="ul0007" list-style="none" compact="compact"><li>x ← V^{(1/e) mod q<sub2>1</sub2>q<sub2>2</sub2>} mod n.</li><li>M ← W⊕h₁(x)</li><li>HV_test = h₂(x, M)</li><li>Compare HV_test = HV</li></ul> return M

In one implementation, the integer "e" is set to two, so that the new family of trapdoor permutations is based on squaring in subgroups of Z_n*.

One of the drawbacks of the cryptography scheme is that the encryption process is slower than traditional RSA encryption because the encoder computes the number x as a function of g, a random element of Z_n^*. Deriving the number x requires additional computations not present in the traditional RSA encryption.

One way to improve the speed of the encryption phase is to compute the number x once and then use the old number x to generate a new number x for the next encryption. In particularly, the improvement involves changing the number x for each new encryption in a manner that is less computationally intensive than recomputing g^R mod n for each new encryption. One approach to generating a new number x from the old number x is as follows: <maths id="math0018" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>←</mo><msup><mrow><mi mathvariant="normal">x</mi></mrow><mrow><mi mathvariant="normal">k exp </mi><mrow><mo>(</mo><mi mathvariant="normal">i</mi><mo>)</mo></mrow></mrow></msup><mo>,</mo></mrow></math><img file="EP1031204B1_D0018.tif" /></maths> where "k exp(i)" is expressed as kⁱ.

The encoder computes the number x (i.e., x = g^R mod n) and stores the number x in memory or a register for subsequent use. For each subsequent encryption, the encoder changes x by computing x^{k exp(i)}, and choosing a value "i" such that the value V remains the same when x is changed. The encoder then sends the value i along with the value V to the decoder for use in recovering the value x.

This process of amortizing the value x over several encryptions reduces the number of computations during each encoding procedure. The cryptography system preserves forward-secrecy for the encoder so that if the number x is leaked, past messages are not compromised, but future messages may be compromised. The encoder may fully recompute the number x at any interval or at any time it deems necessary.

The above cryptography system can also be used to improve decryption speed in batch RSA, a well-known variation of RSA. The cryptography system is similar to that described above, but differs in that the random numbers r₁ and r₂ used to derive prime numbers p₁ and p₂ are further constrained to not be divisible by the first b primes, where b is the decryption batch size..

For the batch RSA, the number x is still derived as follows: <maths id="math0019" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">g</mi></mrow><mrow><mi mathvariant="normal">R</mi></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0019.tif" /></maths>

The value V is then calculated as follows: <maths id="math0020" num=""><math display="block"><mrow><mi mathvariant="normal">V</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">x</mi></mrow><mrow><mi mathvariant="normal">e</mi></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0020.tif" /></maths> where e = (i+1)-th odd prime and i is from Z_b

On the decryption side, the value x is recovered as: <maths id="math0021" num=""><math display="block"><mrow><mi mathvariant="normal">x</mi><mo>=</mo><msup><mrow><mi mathvariant="normal">V</mi></mrow><mrow><mrow><mo>(</mo><mn>1</mn><mo>/</mo><mi mathvariant="normal">e</mi><mo>)</mo><mrow><mi mathvariant="normal"> mod</mi><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi mathvariant="normal"> q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mrow></mrow></msup><mi mathvariant="normal"> mod n</mi></mrow></math><img file="EP1031204B1_D0021.tif" /></maths>

The above modification to batch RSA enables quicker decryption because during the batch inverse operation, the exponents can be reduced modulo q₁ q₂.

Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the claimed invention.