Skip to Main Content
Operating Systems: Concurrent and Distributed Software Design
book

Operating Systems: Concurrent and Distributed Software Design

by Jean Bacon, Tim Harris
March 2003
Intermediate to advanced content levelIntermediate to advanced
912 pages
27h 17m
English
Pearson Business
Content preview from Operating Systems: Concurrent and Distributed Software Design

8.4. Algorithms

Cryptographic algorithms traditionally substituted characters for one another or transposed characters. Successful algorithms typically did multiple substitutions or transpositions. Computerized algorithms work on bits instead of characters but the algorithms still employ substitution and transposition.

8.4.1. Substitution ciphers

In a simple substitution cipher each character in the plaintext is replaced by another character to form the ciphertext. Decryption is simply the reverse substitution. In the Caesar cipher, each character is replaced by the character three places to its right, mod 26, in the alphabet. In UNIX systems ROT13 replaces each character by that 13 places to the right, mod 26, in the alphabet.

Figure 8.3 shows ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Principles of Concurrent and Distributed Programming, Second Edition

Principles of Concurrent and Distributed Programming, Second Edition

M. Ben-Ari
Operating Systems in Depth

Operating Systems in Depth

Thomas W. Doeppner

Publisher Resources

ISBN: 0321117891Purchase book