AATA Public Key Cryptography

Section 7.2 Public Key Cryptography

If traditional cryptosystems are used, anyone who knows enough to encode a message will also know enough to decode an intercepted message. In 1976, W. Diffie and M. Hellman proposed public key cryptography, which is based on the observation that the encryption and decryption procedures need not have the same key. This removes the requirement that the encoding key be kept secret. The encoding function

f

must be relatively easy to compute, but

f^{- 1}

must be extremely difficult to compute without some additional information, so that someone who knows only the encrypting key cannot find the decrypting key without prohibitive computation. It is interesting to note that to date, no system has been proposed that has been proven to be “one-way;” that is, for any existing public key cryptosystem, it has never been shown to be computationally prohibitive to decode messages with only knowledge of the encoding key.

🔗

Subsection The RSA Cryptosystem

🔗

The RSA cryptosystem introduced by R. Rivest, A. Shamir, and L. Adleman in 1978, is based on the difficulty of factoring large numbers. Though it is not a difficult task to find two large random primes and multiply them together, factoring a 150-digit number that is the product of two large primes would take 100 million computers operating at 10 million instructions per second about 50 million years under the fastest algorithms available in the early 1990s. Although the algorithms have improved, factoring a number that is a product of two large primes is still computationally prohibitive.

🔗

The RSA cryptosystem works as follows. Suppose that we choose two random 150-digit prime numbers

p

and

q .

Next, we compute the product

n = p q

and also compute

ϕ (n) = m = (p - 1) (q - 1),

where

ϕ

is the Euler

ϕ

-function. Now we start choosing random integers

E

until we find one that is relatively prime to

m;

that is, we choose

E

such that

gcd (E, m) = 1 .

Using the Euclidean algorithm, we can find a number

D

such that

D E \equiv 1 (\mod m) .

The numbers

n

and

E

are now made public.

🔗

Suppose now that person B (Bob) wishes to send person A (Alice) a message over a public line. Since

E

and

n

are known to everyone, anyone can encode messages. Bob first digitizes the message according to some scheme, say

A = 00, B = 02, \dots, Z = 25 .

If necessary, he will break the message into pieces such that each piece is a positive integer less than

n .

Suppose

x

is one of the pieces. Bob forms the number

y = x^{E} \mod n

and sends

y

to Alice. For Alice to recover

x,

she need only compute

x = y^{D} mod n .

Only Alice knows

D .

🔗

Example 7.5.

Before exploring the theory behind the RSA cryptosystem or attempting to use large integers, we will use some small integers just to see that the system does indeed work. Suppose that we wish to send some message, which when digitized is $25 .$ Let $p = 23$ and $q = 29 .$ Then

n = p q = 667

and

ϕ (n) = m = (p - 1) (q - 1) = 616 .

We can let $E = 487,$ since $gcd (616, 487) = 1 .$ The encoded message is computed to be

25^{487} mod 667 = 169 .

This computation can be reasonably done by using the method of repeated squares as described in Chapter 4. Using the Euclidean algorithm, we determine that $191 E = 1 + 151 m;$ therefore, the decrypting key is $(n, D) = (667, 191) .$ We can recover the original message by calculating

169^{191} mod 667 = 25 .

🔗

Now let us examine why the RSA cryptosystem works. We know that

D E \equiv 1 (\mod m);

hence, there exists a

k

such that

D E = k m + 1 = k ϕ (n) + 1 .

🔗

There are two cases to consider. In the first case assume that

gcd (x, n) = 1 .

Then by Theorem 6.18,

y^{D} = (x^{E})^{D} = x^{D E} = x^{k m + 1} = (x^{ϕ (n)})^{k} x = (1)^{k} x = x mod n .

🔗

So we see that Alice recovers the original message

x

when she computes

y^{D} mod n .

🔗

For the other case, assume that

gcd (x, n) \neq 1 .

Since

n = p q

and

x < n,

we know

x

is a multiple of

p

or a multiple of

q,

but not both. We will describe the first possibility only, since the second is entirely similar. There is then an integer

r,

with

r < q

and

x = r p .

Note that we have

gcd (x, q) = 1

and that

m = ϕ (n) = (p - 1) (q - 1) = ϕ (p) ϕ (q) .

Then, using Theorem 6.18, but now mod

q,

x^{k m} = x^{k ϕ (p) ϕ (q)} = (x^{ϕ (q)})^{k ϕ (p)} = (1)^{k ϕ (p)} = 1 mod q .

🔗

So there is an integer

t

such that

x^{k m} = 1 + t q .

Thus, Alice also recovers the message in this case,

y^{D} = x^{k m + 1} = x^{k m} x = (1 + t q) x = x + t q (r p) = x + t r n = x mod n .

🔗

We can now ask how one would go about breaking the RSA cryptosystem. To find

D

given

n

and

E,

we simply need to factor

n

and solve for

D

by using the Euclidean algorithm. If we had known that

667 = 23 \cdot 29

in Example 7.5, we could have recovered

D .

🔗

Subsection Message Verification

🔗

There is a problem of message verification in public key cryptosystems. Since the encoding key is public knowledge, anyone has the ability to send an encoded message. If Alice receives a message from Bob, she would like to be able to verify that it was Bob who actually sent the message. Suppose that Bob's encrypting key is

(n^{'}, E^{'})

and his decrypting key is

(n^{'}, D^{'}) .

Also, suppose that Alice's encrypting key is

(n, E)

and her decrypting key is

(n, D) .

Since encryption keys are public information, they can exchange coded messages at their convenience. Bob wishes to assure Alice that the message he is sending is authentic. Before Bob sends the message

x

to Alice, he decrypts

x

with his own key:

x^{'} = x^{D^{'}} mod n^{'} .

🔗

Anyone can change

x^{'}

back to

x

just by encryption, but only Bob has the ability to form

x^{'} .

Now Bob encrypts

x^{'}

with Alice's encryption key to form

y^{'} = {x^{'}}^{E} mod n,

🔗

a message that only Alice can decode. Alice decodes the message and then encodes the result with Bob's key to read the original message, a message that could have only been sent by Bob.

🔗

Subsection Historical Note

🔗

Encrypting secret messages goes as far back as ancient Greece and Rome. As we know, Julius Caesar used a simple shift code to send and receive messages. However, the formal study of encoding and decoding messages probably began with the Arabs in the 1400s. In the fifteenth and sixteenth centuries mathematicians such as Alberti and Viete discovered that monoalphabetic cryptosystems offered no real security. In the 1800s, F. W. Kasiski established methods for breaking ciphers in which a ciphertext letter can represent more than one plaintext letter, if the same key was used several times. This discovery led to the use of cryptosystems with keys that were used only a single time. Cryptography was placed on firm mathematical foundations by such people as W. Friedman and L. Hill in the early part of the twentieth century.

🔗

The period after World War I saw the development of special-purpose machines for encrypting and decrypting messages, and mathematicians were very active in cryptography during World War II. Efforts to penetrate the cryptosystems of the Axis nations were organized in England and in the United States by such notable mathematicians as Alan Turing and A. A. Albert. The Allies gained a tremendous advantage in World War II by breaking the ciphers produced by the German Enigma machine and the Japanese Purple ciphers.

🔗

By the 1970s, interest in commercial cryptography had begun to take hold. There was a growing need to protect banking transactions, computer data, and electronic mail. In the early 1970s, IBM developed and implemented LUZIFER, the forerunner of the National Bureau of Standards' Data Encryption Standard (DES).

🔗

The concept of a public key cryptosystem, due to Diffie and Hellman, is very recent (1976). It was further developed by Rivest, Shamir, and Adleman with the RSA cryptosystem (1978). It is not known how secure any of these systems are. The trapdoor knapsack cryptosystem, developed by Merkle and Hellman, has been broken. It is still an open question whether or not the RSA system can be broken. In 1991, RSA Laboratories published a list of semiprimes (numbers with exactly two prime factors) with a cash prize for whoever was able to provide a factorization (http://www.emc.com/emc-plus/rsa-labs/historical/the-rsa-challenge-numbers.htm ⁷). Although the challenge ended in 2007, many of these numbers have not yet been factored.

🔗

There been a great deal of controversy about research in cryptography and cryptography itself. In 1929, when Henry Stimson, Secretary of State under Herbert Hoover, dismissed the Black Chamber (the State Department's cryptography division) on the ethical grounds that “gentlemen do not read each other's mail.” During the last two decades of the twentieth century, the National Security Agency wanted to keep information about cryptography secret, whereas the academic community fought for the right to publish basic research. Currently, research in mathematical cryptography and computational number theory is very active, and mathematicians are free to publish their results in these areas.

www.emc.com/emc-plus/rsa-labs/historical/the-rsa-challenge-numbers.htm

Abstract Algebra: Theory and Applications

Search Results:

Section 7.2 Public Key Cryptography

Subsection The RSA Cryptosystem

Example 7.5.

Subsection Message Verification

Subsection Historical Note