Cryptography, Information Theory, and Error-Correction. Aiden A. Bruen

Чтение книги онлайн.

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

Cryptography, Information Theory, and Error-Correction - Aiden A. Bruen

Скачать книгу

href="#fb3_img_img_18180ee9-b59a-5669-970a-9f9c8621b879.png" alt="left-bracket upper N comma e right-bracket"/>, the decryption index need not be unique! We provide several examples. This is important because some attacks on RSA are possible if d is small; we refer to Chapter 7. So if d is not unique, this makes it more difficult to guard against this attack.

      What we mean by “not unique” is that there may be more than one value of d such that the remainder of upper C Superscript d, on division by upper N, is upper M. The reason for nonuniqueness is that, instead of working with left-parenthesis p minus 1 right-parenthesis left-parenthesis q minus 1 right-parenthesis, we can work with any number t that is divisible by p minus 1 and q minus 1, as explained in the algorithm description and in Chapter 19. It is often possible to find t less-than left-parenthesis p minus 1 right-parenthesis left-parenthesis q minus 1 right-parenthesis so that the calculations are simplified, and we get a shortcut even if the resulting d is the same.

      We present new insights on public key and symmetric encryption.

      

      Cryptography is an old subject dating back at least as far as 1500 BCE. A technique developed by Porta associated also with Vigenère in the Middle Ages is close to the cutting edge of part of modern cryptography. Additionally, cryptography is closely connected to information theory and error‐correction, with many fundamental ideas going back to Claude Shannon. Further details about Shannon and the history of cryptography are provided in Chapter 1.

      Cryptography is the art of keeping messages secret. Imagine that A, B are two entities who wish to communicate in secret. Assume A wants to send a secret message to B.

Schematic illustration of the general encryption.

      In summary, the sender A encrypts or enciphers the message upper M into unintelligible cipher text upper C using an encrypting or enciphering key. The enciphering is done by a specific procedure involving a sequence of steps or rules called the enciphering algorithm (or encryption algorithm).

      Using the decryption or deciphering key, and using the deciphering algorithm (decryption algorithm), the receiver B then decrypts or deciphers upper C and thus recovers the original message upper M that was transmitted by the transmitter A. Moreover, at least in theory, an intruder Eve cannot access the message upper M since Eve will not have the decryption key that is needed for decrypting (deciphering, inverting) upper C to recover upper M.

      Evidently, everything depends on B being the sole possessor of the decryption key, apart possibly from A. (If the decryption and encryption keys are the same – as they are in symmetric encryption, then A also has the decryption key).

      Generally speaking, a key is a mathematical object such as a number (or several numbers) or a string of zeros and ones, i.e. a binary string such as the binary string (1 1 0 1) of length 4.

      The enciphering and deciphering operations are usually mathematical procedures. For example, let us suppose that the enciphering key is the number 7 and that the enciphering operation is “add 7.” Suppose the secret message that A wants to transmit to B is the number 6. (For example A might be directing her stockbroker B to buy six thousand shares of a given security on the stock market).

      Then, A calculates the cipher text 13 ( = 6 plus 7) and transmits this to B. Now, B knows that the enciphering transformation is “add 7.” To undo, or invert this, B subtracts 7 from 13 (as this is the deciphering operation) and ends up recovering the original message transmitted by A, namely 6.

      Using encryption for storing messages and files is another important function of encryption in today's society. As an example, we mention

Скачать книгу