1 / 39

Encryption

Encryption. only the basics. Reading Assignment. Why crypto is hard http://www.counterpane.com/whycrypto.html. Topics. What is Cryptology? Conventional Encryption (secret key) Terminology and Properties Public Key Encryption Terminology Usage Properties Cryptanalysis.

lynna
Download Presentation

Encryption

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. Encryption only the basics

  2. Reading Assignment • Why crypto is hard http://www.counterpane.com/whycrypto.html

  3. Topics • What is Cryptology? • Conventional Encryption (secret key) • Terminology and Properties • Public Key Encryption • Terminology • Usage • Properties • Cryptanalysis

  4. Cryptology Definition • Cryptography is the making of ciphers and codes. • Cryptanalysis is the analysis and breaking of those ciphers. • Cryptology is the study of both. (AMTH 387)

  5. Cryptography • Classified along three independent dimensions: • The type of operations used for transforming plaintext to ciphertext (substitution, transposition) • The number of keys used • symmetric (single key) • asymmetric (two-keys, or public-key encryption) • The way in which the plaintext is processed (block, stream)

  6. Substitution and Transposition • Substitution example • A B C D E F G … • C D E F G H I … • Transposition example • HERE_IS_A_MESSAGE H E S _ S G E _ _ M S E R I A E A _

  7. Secret Key Cryptography • An encryption scheme has five ingredients: • Plaintext • Encryption algorithm • Secret Key • Ciphertext • Decryption algorithm • Security depends on the secrecy of the key, not the secrecy of the algorithm

  8. Use of Conventional Encryption

  9. Average time required for exhaustive key search

  10. Feistel Cipher Structure • Many conventional block encryption algorithms, including DES have a structure first described by Horst Feistel of IBM in 1973 • The realization of a Fesitel Network depends on the choice of the following parameters and design features (see next slide):

  11. Feistel Cipher Structure • Block size: larger block sizes mean greater security • Key Size: larger key size means greater security • Number of rounds: multiple rounds offer increasing security • Subkey generation algorithm: greater complexity will lead to greater difficulty of cryptanalysis. • Fast software encryption/decryption: the speed of execution of the algorithm becomes a concern

  12. Exclusive OR • Message 0101 1100, key 1001 • Encryption process • Plaintext 0101 1100 • Key 1001 1001 • Cyphertext 1100 0101 • Decryption process • Cyphertext 1100 0101 • Key 1001 1001 • Plaintext

  13. Conventional Encryption Algorithms • Data Encryption Standard (DES) • The most widely used encryption scheme • The algorithm is referred to as the Data Encryption Algorithm (DEA) • DES is a block cipher • The plaintext is processed in 64-bit blocks • The key is 56-bits in length

  14. Time to break a code (106 decryptions/µs)

  15. Triple DEA • Use three keys and three executions of the DES algorithm (encrypt-decrypt-encrypt) • C = ciphertext • P = Plaintext • EK[X] = encryption of X using key K • DK[Y] = decryption of Y using key K • Effective key length of 168 bits C = EK3[DK2[EK1[P]]]

  16. Other Symmetric Block Ciphers • International Data Encryption Algorithm (IDEA) • 128-bit key • Used in PGP • Blowfish • Easy to implement • High execution speed • Run in less than 5K of memory

  17. Other Symmetric Block Ciphers • RC5 • Suitable for hardware and software • Fast, simple • Adaptable to processors of different word lengths • Variable number of rounds • Variable-length key • Low memory requirement • High security • Data-dependent rotations • Cast-128 • Key size from 40 to 128 bits • The round function differs from round to round

  18. Analysis of DES • Advantages • Attacks well known • 3DES has effective key length of 168 • Disadvantages • No efficient software implementation • Must use 64 bit block

  19. AES • AES (Advanced Encryption Standard) was adopted by NIST in November 2001. Also called the Rijndael algorithm. • Supports key size of 128, 192, and 256 bits. • Symmetric block cipher with block length of 128 bits. • Efficient hardware and software implementations. • Not a Feistal block cipher.

  20. Location of Encryption Device • Link encryption: • A lot of encryption devices • High level of security • Decrypt each packet at every switch • End-to-end encryption • The source encrypt and the receiver decrypts • Payload encrypted • Header in the clear • High Security: Both link and end-to-end encryption are needed

  21. Key Distribution • A key could be selected by A and physically delivered to B. • A third party could select the key and physically deliver it to A and B. • If A and B have previously used a key, one party could transmit the new key to the other, encrypted using the old key. • If A and B each have an encrypted connection to a third party C, C could deliver a key on the encrypted links to A and B.

  22. Key Distribution • Session key: • Data encrypted with a one-time session key. At the conclusion of the session the key is destroyed • Permanent key: • Used between entities for the purpose of distributing session keys

  23. Public-Key Cryptography Principles • The use of two keys has consequences in: key distribution, confidentiality and authentication. • The scheme has six ingredients • Plaintext • Encryption algorithm • Two keys: Public and private key • Ciphertext • Decryption algorithm (inverse of encryption) • Property: If you encrypt with one key, you need the other key to decrypt.

  24. Encryption for Confidentiality using Public-Key system

  25. Authentication usingPublic-Key System

  26. Applications for Public-Key Cryptosystems • Three categories: • Encryption/decryption for confidentiality: The sender encrypts a message with the recipient’s public key. • Digital signature (authentication): The sender ”signs” a message with his private key. • Key exchange: Two sides cooperate two exhange a session key.

  27. Requirements for Public-Key Cryptography • Computationally easy for a party B to generate a pair (public key KUb, private key KRb) • Easy for sender to generate ciphertext: • Easy for the receiver to decrypt ciphertext using private key:

  28. Requirements for Public-Key Cryptography • Computationally infeasible to determineprivate key (KRb) knowing public key (KUb) • Computationally infeasible to recover message M, knowing KUb and ciphertext C • Either of the two keys can be used for encryption, with the other used for decryption:

  29. Public-Key Cryptographic Algorithms • RSA and Diffie-Hellman • RSA - Ron Rives, Adi Shamir and Len Adleman at MIT, in 1977. • RSA is a block cipher • The most widely implemented • Diffie-Hellman • Exchange a secret key securely • Compute discrete logarithms

  30. Diffie-Hellman Key Exchange

  31. Other Public-Key Cryptographic Algorithms • Digital Signature Standard (DSS) • Makes use of the SHA-1 • Not for encryption or key exchange • Elliptic-Curve Cryptography (ECC) • Good for smaller bit size • Low confidence level, compared with RSA • Very complex

  32. Cryptographic Hash Functions • Example: http://nsfsecurity.pr.erau.edu/crypto/generichash.html

  33. Cryptanalysis • If only the ciphertext is available • Pattern and frequency analysis for simple ciphers • Brute force – try all possible keys • If <plaintext, ciphertext> is available • Previously classified info is unclassified • Encrypted info includes known patterns (packet headers)

  34. For Further Reading • “Cryptography and Network Security, Principles and Practice” third edition, William Stallings, Prentice Hall • For more detailed coverage, take the Applied Math course: AMTH 387

More Related