Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Review 789

    Uploaded by

    Huỳnh Đông Hên
    This document provides an overview of cryptography concepts including symmetric and asymmetric ciphers, cryptanalysis techniques, hash functions, message authentication codes, and digital signatures. It discusses traditional substitution and transposition ciphers, block and stream ciphers, cryptographic hash functions like MD5 and SHA, and digital signatures. Public key cryptography techniques like RSA and Diffie-Hellman key exchange are introduced along with modular arithmetic fundamentals. Symmetric ciphers like DES and AES are covered along with encryption modes for large messages. Key management using symmetric techniques and public key infrastructure is also summarized.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Review 789

    Uploaded by

    Huỳnh Đông Hên
    22 views4 pages
    This document provides an overview of cryptography concepts including symmetric and asymmetric ciphers, cryptanalysis techniques, hash functions, message authentication codes, and digital signatures. It discusses traditional substitution and transposition ciphers, block and stream ciphers, cryptographic hash functions like MD5 and SHA, and digital signatures. Public key cryptography techniques like RSA and Diffie-Hellman key exchange are introduced along with modular arithmetic fundamentals. Symmetric ciphers like DES and AES are covered along with encryption modes for large messages. Key management using symmetric techniques and public key infrastructure is also summarized.

    Original Title

    review789

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of cryptography concepts including symmetric and asymmetric ciphers, cryptanalysis techniques, hash functions, message authentication codes, and digital signatures. It discusses traditional substitution and transposition ciphers, block and stream ciphers, cryptographic hash functions like MD5 and SHA, and digital signatures. Public key cryptography techniques like RSA and Diffie-Hellman key exchange are introduced along with modular arithmetic fundamentals. Symmetric ciphers like DES and AES are covered along with encryption modes for large messages. Key management using symmetric techniques and public key infrastructure is also summarized.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    22 views4 pages

    Review 789

    Uploaded by

    Huỳnh Đông Hên
    This document provides an overview of cryptography concepts including symmetric and asymmetric ciphers, cryptanalysis techniques, hash functions, message authentication codes, and digital signatures. It discusses traditional substitution and transposition ciphers, block and stream ciphers, cryptographic hash functions like MD5 and SHA, and digital signatures. Public key cryptography techniques like RSA and Diffie-Hellman key exchange are introduced along with modular arithmetic fundamentals. Symmetric ciphers like DES and AES are covered along with encryption modes for large messages. Key management using symmetric techniques and public key infrastructure is also summarized.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    Chapter 07: Introduction to Cryptography

    I. Overview

    1. Cryptology
    2. Security Services, Cryptography Primitives
    3. CryptoSystem (Symmetric, Asymmetric)
    4. Two basic principle in cryptography algorithms
    5. Stream cipher vs Block cipher
    6. Approaches attacking a cipher (cryptanalysis, brute force)

    II. Traditional Ciphers


    1. Substitution Ciphers
    + Mono-alphabetic
    + Poly-alphabetic
    2. Transposition cipher
    III. Message Integrity & Hash function
    1. Cryptographic Hash
    + Message Digest
    + Cryptographic Hash:
     Properties: (compression, computational efficiency, random, avalanche effect
     Requirements (one-way, weak collision resistance, collision resistance)
    2. Hash Algorithms:
    + Merkle-Damgard construction
    + Two general types of hash functions (dedicated, block cipher-based hash function)
    3. Popular hash functions
    + MD5
    + SHA-1
    IV Message Authentication Code (MAC)
    1. Properties (arbitrary input length, fix output length, message authentication, integrity)
    2. Limitations
    3. HMAC
    V. Digital signature
    Questions
    1. What are security services that cryptography provided?
    2. What are cryptography primitives?
    3. What are the essential ingredients of a symmetric cipher?
    4. What are the two basic functions used in encryption algorithms?
    5. How many keys are required for two people to communicate via a symmetric cipher?
    6. What is the difference between a block cipher and a stream cipher?
    7. What are the two general approaches to attacking a cipher?
    8. A cryptographer once stated that cryptography could provide complete security, and that any other
    computer security controls were unnecessary. Why is he wrong? (Hint: Think of an implementation
    of a cryptosystem, and ask yourself what aspect(s) of the implementation can cryptography not
    protect.)
    9. In term of security services provide, is it safe to use a Cryptosystem with MAC + Encryption to
    transmit & receive message? Justify your reason?
    10. Hashing is being used to secure password in Linux. Alice and Bob unintentionally set their
    passwords similar. Are the stored password of both identical? Explain your answer?
    11. Why do SHA-2 hash functions use 224, 256, 384, 512 as output bit length?
    12. A plaintext message of 64 bytes is being sent. To protect the message integrity, a SHA-256 message
    digest is generated. Calculate the numbers of padding input bit for the SHA generator.
    13. To verify the integrity of a 1KB plaintext, a MD5 digest is generated. How many bits are needed to
    pad to the plaintext?
    14. What are the limitations of MAC functions?
    15. Which security services does digital signature provide? Explain your answer?
    16. Which cryptography primitives being used in IPsec?

    Chapter 08: Symmetric-Key Encryption


    I. Modern Block Cipher
    1. Components (P-box, S-box, XOR operation, swapping, splitting, shifting, combining)
    2. Principles (confusion, diffusion)
    II. Data Encryption Standard (DES)
    1. Feistel structure
    2. DES
    3. 3DES
    III. Advanced Encryption Standard (AES)
    IV. Encrypting large message
    1. Modes: ECB, CBC, CFB, OFB, CTR
    2. Evaluation criteria (Identical messages, Chaining dependency, Error propagation, Efficiency)

    Questions
    1. What are basic components of modern block cipher?
    2. List various types of P-box that you know.
    3. List properties of DES (bit size of input, output, and key)
    4. Briefly describe functional blocks of Feistel structure, including input/output/key bit size.
    5. Briefly describe functional blocks of DES cipher, including input/output/key bit size.
    6. Briefly describe functional blocks of AES cipher, including input/output/key bit size.
    7. How many versions of key in 3DES are there?
    8. How many versions of AES are there? Describe the corresponding changes in internal structure
    of AES for each version?
    9. What is the output of the first round of the DES algorithm when the plaintext and the key are
    both all zeros?
    10. What is the output of the first round of the DES algorithm when the plaintext and the key are
    both all ones?

    Chapter 09: Public-Key Encryption


    I. Modular Arithmetic
    1. Modulo, modulus
    2. Congruence modulo
    3. Properties (addition, subtraction, multiplication, exponentiation)
    4. Modular inverse (additive, multiplicative)
    5. Totient (Euler’s phi) function
    II. RSA
    1. Algorithm
    2. Encryption & Decryption
    3. Example
    III. Diffie-Hellman Key exchange
    1. Algorithm
    2. Example
    3. Man-in-the-middle attack on key exchange protocol
    IV. Key Management
    1. Symmetric-key distribution
     Key-distribution center: KDC
     Multiple KDC
     Session key
    2. Symmetric-key agreement
     Diffie-Hellman key agreement
    3. Public-key distribution
     Public announcement
     CA
     X.509
    Questions
    1. Compute without a calculator.
    a) 15x29 mod 13
    b) 2x29 mod 13
    c) 2x3 mod 13
    d) −11x3 mod 13
    2. Compute without using a calculator:
    a) x=32 mod 13
    b) x=72 mod 13
    c) x=310 mod 13
    d) x=7100 mod 13
    e) 7x = 11 mod 13
    3. Find all integers n between 0 ≤ n < m that are relatively prime to m for m = 4, 5, 9, 26 (Euler’s
    phi function)
    4. Describe the RSA algorithm, including the encrypting & decrypting steps.
    5. Let the two primes p = 41 and q = 17 be given as set-up parameters for RSA.
    a) Which of the parameters e1 = 32, e2 = 49 is a valid RSA exponent? Justify your choice.
    b) Compute the corresponding private key Kpr = (p,q,d). Use the extended Euclidean
    algorithm for the inversion and explain every calculation step.
    6. Encrypt and decrypt by means of the RSA algorithm with the following system parameters:
    a) p = 3, q = 11, d = 7, x = 5
    b) p=5, q=11, e=3, x=9
    7. Describe the Man-in-the-middle attack on key exchange protocol.
    8. Prove that the calculation of both side in DHKE algorithm yields the same result which is the
    share key between both parties.
    9. Why the Certificate Authority (CA) is needed in a public-key cryptosystem?
    10. What’s the purpose of X.509 protocol?
    11. Which techniques behind a secured web transaction over the internet? Justify your answer?

    You might also like