Đang chuẩn bị liên kết để tải về tài liệu:
Lecture notes on Computer and network security: Lecture 12 - Avinash Kak

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG

Lecture 12, public-key cryptography and the RSA algorithm. In this chapter, the learning objectives are: To review public-key cryptography, to demonstrate that confidentiality and sender-authentication can be achieved simultaneously with public-key cryptography, to review the RSA algorithm for public-key cryptography,. | Lecture 12: Public-Key Cryptography and the RSA Algorithm Lecture Notes on “Computer and Network Security” by Avi Kak (kak@purdue.edu) February 28, 2016 11:34pm c 2016 Avinash Kak, Purdue University Goals: • To review public-key cryptography • To demonstrate that confidentiality and sender-authentication can be achieved simultaneously with public-key cryptography • To review the RSA algorithm for public-key cryptography • To present the proof of the RSA algorithm • To go over the computational issues related to RSA • To discuss the vulnerabilities of RSA • Perl and Python implementations for generating primes and for factorizing medium to large sized numbers CONTENTS Section Title Page 12.1 Public-Key Cryptography 3 12.2 The Rivest-Shamir-Adleman (RSA) Algorithm for Public-Key Cryptography — The Basic Idea 8 12.2.1 The RSA Algorithm — Putting to Use the Basic Idea 12 12.2.2 How to Choose the Modulus for the RSA Algorithm 14 12.2.3 Proof of the RSA Algorithm 17 12.3 Computational Steps for Key Generation in RSA 21 12.3.1 Computational Steps for Selecting the Primes p and q 22 12.3.2 Choosing a Value for the Public Exponent e 24 12.3.3 Calculating the Private Exponent d 27 12.4 A Toy Example That Illustrates How to Set n, e, and d for a Block Cipher Application of RSA 28 12.5 Modular Exponentiation for Encryption and Decryption 34 12.5.1 An Algorithm for Modular Exponentiation 38 12.6 The Security of RSA — Vulnerabilities Caused by Lack of Forward Secrecy 42 12.7 The Security of RSA — Chosen Ciphertext Attacks 45 12.8 The Security of RSA — Vulnerabilities Caused by LowEntropy Random Numbers 51 12.9 The Security of RSA — The Mathematical Attack 55 12.10 Factorization of Large Numbers: The Old RSA Factoring Challenge 75 12.10.1 The Old RSA Factoring Challenge: Numbers Not Yet Factored 79 12.11 The RSA Algorithm: Some Operational Details 81 12.12 RSA: In Summary 92 12.13 Homework .

Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.