Cryptography, Information Theory, and Error-Correction. Aiden A. Bruen
Чтение книги онлайн.

Читать онлайн книгу Cryptography, Information Theory, and Error-Correction - Aiden A. Bruen страница 35

Название: Cryptography, Information Theory, and Error-Correction

Автор: Aiden A. Bruen

Издательство: John Wiley & Sons Limited

Жанр: Зарубежная компьютерная литература

Серия:

isbn: 9781119582403

isbn:

СКАЧАТЬ even an entire hard drive (or solid state drive) – in a computer so that, if it is set aside (or stolen) an individual other than the owner cannot access the contents. (Apple and Windows both have encryption applications that use XTS‐AES‐128 encryption with a 256‐bit key. Apple's MacOS uses it in FileVault 2, [App18], and Windows 10 version 1511 uses it in their Bitlocker feature, [Win19].) We can fit this into our previous general situation with the owner of the computer playing the role of both A and B.

      We have been silent on how A and B get their enciphering and deciphering keys. This is discussed in a later chapter, but will depend on the kind of encryption being used. The two fundamentally different possibilities for cryptography are as follows:

      1 Symmetric Cryptography

      2 Asymmetric Cryptography, i.e. Public Key Cryptography.

 Schematic illustration of the symmetric encryption.

      1 The enciphering key used by the transmitter A is equal to the deciphering key used by the receiver B and this key is known only to A and B.

      2 The enciphering algorithm, converting the plain text to cipher text, is such that the cipher text can be calculated immediately given and .

      3 The deciphering algorithm, converting back to , can be calculated immediately given and .

      The security depends on the fact that the secret key upper K is known only to A and B.

      1 The enciphering key used by A (or anybody else) to send a message to B is publicly known, and is called the public key of B. However, the deciphering key used by B to decrypt the cipher text is known only to B and is the private key of B. So the two keys are quite different.

      2 The enciphering procedure, converting the plain text to cipher text , can be immediately calculated given M and .

      3 The deciphering procedure, converting back to M, can be calculated immediately by B using . However, it is not possible for somebody else who is not in possession of to convert back to M in a reasonable amount of time.The security of public key cryptography rests on the assumption that it is not feasible to convert back to M without knowledge of the private key .Thus, in public key cryptography each user B in a network has a public key and a private key , which are supplied by a public key authority (PKA).

 Schematic illustration of the asymmetric or public encryption.

      Historically, cryptography meant symmetric cryptography. Nowadays, important symmetric algorithms in use are AES and the One‐Time Pad which is sometimes derived from a shift register (see Chapter 16).

      We now turn to some examples of asymmetric or public key cryptography. First, let us explain RSA, the main public key algorithm. As before, A wants to send a secret message upper M to B. For convenience, let us think of upper M as being the number 6, say, as in our previous example. We make the encryption more complicated. So instead of saying “add 7,” we say “multiply 6 by itself 7 times” i.e. calculate left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis left-parenthesis 6 right-parenthesis equals 6 Superscript 7 Baseline equals 279 936. As an extra complication, let us take some number upper N and declare the encryption algorithm to be “multiply 6 by itself 7 times and take the remainder of this number when divided by upper N to be the cipher text upper C.” As a small working example, let upper N equals 55. So our cipher text is the remainder of 6 Superscript 7 upon division by 55. This remainder is easily calculated, using any calculator, as follows:

      We want to find the (unique) remainder z that is left over when we divide 279 936 by 55. So we have

      (3.6)StartFraction 279 936 Over 55 EndFraction equals y plus StartFraction z Over 55 EndFraction

      Pushing the divide button on the calculator, we get

      (3.7)StartFraction 279 936 Over 55 EndFraction equals 5089.745 <a href=СКАЧАТЬ