1 / 16

INFORMATION AND NETWORK SECURITY

INFORMATION AND NETWORK SECURITY. Prepared by, Sumangala Biradar. Module-1. Introduction. Cryptology — the art and science of making and breaking "secret codes ." Cryptography — the making of "secret codes."

cransom
Télécharger la présentation

INFORMATION AND NETWORK SECURITY

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. INFORMATION AND NETWORK SECURITY Prepared by, Sumangala Biradar

  2. Module-1

  3. Introduction • Cryptology — the art and science of making and breaking "secret codes." • Cryptography— the making of "secret codes." • Cryptanalysis — the breaking of "secret codes." • Crypto — a synonym for any or all of the above (and more), where the precise meaning should be clear from context.

  4. Contd.., • A cipher or crypto system is used to encryptdata. • The original unencrypted data is known as plaintext • The result of encryption is ciphertext. • A keyis used to configure a cryptosystem for encryption and decryption. • In a symmetric cipher, the same key is used to encrypt and to decrypt

  5. Public key cryptography • The encryption and decryption keysare different. • In public key crypto, the encryption key is, appropriately, known as the public key, whereas the decryption key, which must remain secret, is the private key.

  6. Classic Crypto Simple Substitution Cipher (k=3 is Caesar's cipher) • For example, with n = 3, the substitution—which acts as the key—is • The plaintext message is fourscoreandsevenyearsago • The resulting ciphertextis IRXUVFRUHDAGVHYHABHDUVDIR • 26 possible keys (brute force attack/exhaustive key search)

  7. Contd.., Double Transposition Cipher • we write the plaintext attackatdawninto a 3 x 4 array: • Transpose (or permute) the rows according to (1,2,3) —> (3,2,1) and then transpose the columns according to (1,2,3,4) —» (4,2,1,3), we obtain • The ciphertext is then read from the final array: NADWTKCAATAT

  8. Contd.., • To decrypt (2.3), the ciphertext is first put into a 3 x 4 array. Then the columns are numbered as (4,2,1,3) and rearranged to (1,2,3,4), and the rows are numbered (3,2,1) and rearranged into (1,2,3), • Recovered the plaintext, namely, attackatdawn. One-Time Pad (Vernamcipher)

  9. OTP • The plaintextmessage is “h e i l h i t l e r “. • Decryption

  10. Charlie claims that the actual key used to encrypt Alice's message is 101 111 000 101 111 100 000 101 110 000 • Bob decrypts the ciphertext using the key given to him by Charlie and obtains

  11. Contd.., • Two plaintext messages P1 and P2 are encrypted using same key (in depth) as a C1 = P1K and C2 = P2K • Then C1 C2 = P1 K P2 K = P1P2 • suppose we have P1 = l i k e = 100010011000 and P2 = k i t e = 011010111000 and both are encrypted with the same key K = 110 011 101 111. Then

  12. Contd.., • Suppose that Trudy (who only has C\ and C2) suspects that P1= k i l l = 011010100100. Then she can find the corresponding putative key: • and she can then use this K to "decrypt" C2 and obtain • When Trudy eventually guesses P1= like she will obtain the correct key K and decrypt to find P2 = kite

  13. Project VENONA • Real-world example for use of the one-time pad • Codebook Cipher : a dictionary-like book containing (plaintext) words and their corresponding (ciphertext) codewords. To encrypt a given word, the cipher clerk would simply look up the word in the codebook and replace it with the corresponding codeword. Decryption, using the inverse codebook, was equally straightforward. • Not resist against statistical attacks. Hence Additive (adding random bits) methods is used. The sequence of 5-digit additives would be added to the codewords to create the ciphertext.

  14. Contd.., • Modern block ciphers use complex algorithms to generate ciphertextfrom plaintext (and vice versa), but at a higher level, a block cipher can be viewed as a codebook, where each key determines a distinct codebook. • In block ciphers, concept of an additive also lives on, in the form of an initialization vector, or IV,

  15. Ciphers of the Election of 1876 • Ciphers of the Election of 1876 • Modern Crypto History : confusion(substitution, OTP) Diffusion (Double Transposition )

  16. A Taxonomy of Cryptography • symmetric ciphers : stream ciphers (efficient in hardware ) and block ciphers(optimize for software implementations). • public key cryptosystems :encryption (public keys), decryption (private key) • hash functions : A Taxonomy of Cryptanalysis • To recover the plaintext, the key, or both • ciphertext only attack : knows the algorithms and the ciphertext • known plaintext attack : know some of the plaintext and observe the corresponding ciphertext • chosen plaintext attack : choose the plaintext to be encrypted and see the corresponding ciphertext • adaptively chosen plaintext attack: • Related key attacks : • Forward search :

More Related