Scribd
Upload
75 views2 pages

CH 6

summry for the first chapters of Cryptography and Network Security: Principles and Practice, Sixth Edition

Uploaded by

al.wasel711
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
75 views2 pages

CH 6

summry for the first chapters of Cryptography and Network Security: Principles and Practice, Sixth Edition

Uploaded by

al.wasel711
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Misconceptions Concerning Public-Key Encryption:

• Addresses common misconceptions about public-key encryption, including its


superiority to symmetric encryption, its impact on symmetric encryption's
obsolescence, and its perceived ease of key distribution.

2. Principles of Public-Key Cryptosystems:

• Discusses the principles and challenges of secure communication without relying on a


Key Distribution Center (KDC), emphasizing the key distribution problem and message
authenticity verification.

3. Public-Key Cryptosystems:

• Explains the essential components of a public-key encryption scheme, which include


plaintext, encryption/decryption algorithms, public and private keys, ciphertext, and
the decryption algorithm.

4. Applications for Public-Key Cryptosystems:

• Categorizes public-key cryptosystems into three applications: encryption/decryption


with the recipient's public key, digital signatures, and key exchange sessions.

5. Public-Key Requirements:

• Lists the key conditions for a satisfactory public-key algorithm, highlighting the
importance of having a trap-door one-way function to ensure security.

6. Public-Key Cryptanalysis:

• Examines potential attacks on public-key encryption, including brute force,


mathematical attacks, timing attacks, hardware fault-based attacks, and chosen
ciphertext attacks.

7. Rivest-Shamir-Adleman (RSA) Scheme:

• Introduces the widely used RSA algorithm, its structure, and its reliance on
mathematical properties to secure data.

8. Efficient Operation Using the Public Key:

• Explains the use of specific values for e in the RSA algorithm to enhance the efficiency
of encryption.

9. Efficient Operation Using the Private Key:

• Discusses decryption efficiency by employing the Chinese Remainder Theorem (CRT)


and using d mod (p - 1) and d mod (q - 1) precalculations.

10. Key Generation:

• Describes the process of generating public and private key pairs, including prime
number selection and suitable trap-door one-way functions.
11. The Security of RSA:

• Explores the potential vulnerabilities and attack methods related to RSA, such as brute
force attacks, mathematical attacks, timing attacks, hardware fault-based attacks, and
chosen ciphertext attacks.

12. Example of RSA Algorithm:

• Demonstrates how RSA encryption and decryption work with an illustrative example.

13. Exponentiation in Modular Arithmetic:

• Discusses the use of modular arithmetic for RSA exponentiation, making specific
mention of its efficiency.

14. Constant Exponentiation Time:

• Describes countermeasures against timing attacks, such as ensuring that all


exponentiations take the same amount of time.

15. Random Delay and Blinding:

• Introduces other countermeasures, including adding random delays to exponentiation


and blinding to protect against timing attacks.

16. Fault-Based Attack:

• Explains an attack that induces faults in the signature computation, which can lead to
the recovery of the private key.

17. Chosen Ciphertext Attack (CCA):

• Describes the CCA method where an adversary selects ciphertexts and corresponding
plaintexts to retrieve sensitive information.

18. Optimal Asymmetric Encryption Padding (OAEP):

• Discusses a countermeasure to CCA attacks, recommending OAEP for modifying


plaintexts.

You might also like