1 / 43

Lecture 7 Discrete Logarithms

Lecture 7 Discrete Logarithms.

kendall-stevens
Download Presentation

Lecture 7 Discrete Logarithms

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. Lecture 7 Discrete Logarithms

  2. In the RSA algorithm, we saw how the difficulty of factoring yields useful cryptosystem. There is another number theory problem, namely discrete logarithms, that has similar applications. According to Diffie, the discrete logarithm problem was suggested by Gill. The discrete logarithm problem is a major open question in public-key cryptography.

  3. Outline • Discrete Logarithms • Computing Discrete Logs • The ElGamal Public Key Cryptosystem • Bit Commitment

  4. 1 Discrete Logarithms

  5. 2 Computing Discrete Logs 2.1 Exhaustive Search

  6. 2.2 Baby-Step Giant-Step Algorithm

  7. 2.2 Baby-Step Giant-Step Algorithm (Continued)

  8. 2.2 Baby-Step Giant-Step Algorithm (Continued)

  9. 2.2 Baby-Step Giant-Step Algorithm (Continued)

  10. 2.3 Pollard’s Rho Algorithm

  11. 2.3 Pollard’s Rho Algorithm (Continued)

  12. 2.3 Pollard’s Rho Algorithm (Continued)

  13. 2.3 Pollard’s Rho Algorithm (Continued)

  14. 2.3 Pollard’s Rho Algorithm (Continued)

  15. 2.3 Pollard’s Rho Algorithm (Continued)

  16. 2.4 Pohlig-Hellman Algorithm

  17. 2.4 Pohlig-Hellman Algorithm (Continued)

  18. 2.4 Pohlig-Hellman Algorithm (Continued)

  19. 2.4 Pohlig-Hellman Algorithm (Continued)

  20. 2.4 Pohlig-Hellman Algorithm (Continued)

  21. 2.5 The Index-Calculus Algorithm

  22. 2.5 The Index-Calculus Algorithm (Continued)

  23. 2.5 The Index-Calculus Algorithm (Continued)

  24. 2.5 The Index-Calculus Algorithm (Continued)

  25. 2.5 The Index-Calculus Algorithm (Continued)

  26. 2.5 The Index-Calculus Algorithm (Continued)

  27. 3 The ElGamal Public Key Cryptosystem The security of the ElGamal public-key encryption scheme is relies on the intractability of the discrete logarithm problem and the Diffie-Hellman problem. The basic ElGamal encryption scheme is done by ElGamal in 1985.

  28. 3.1 Description

  29. 3.1 Description (Continued)

  30. 3.1 Description (Continued)

  31. 3.2 Example

  32. 3.3 Efficiency of ElGamal Encryption

  33. 3.4 Security of ElGamal Encryption

  34. 3.4 Security of ElGamal Encryption (Continued)

  35. 4 Bit Commitment 4.1 Scenarios (1) Alice claims that she has a method to predict the outcome of football games. She wants to sell her method to Bob. Bob asks her method works by predicting the results of the games that will be played this weekend. “No way,” says Alice. “Then you will simply make your bets and not pay me. Why don’t I show you my predictions for last week’s game?”

  36. 4.2 Requirements of Bit Commitment Alice can send a bit b, which is either 0 or 1, to Bob. It require that (1) Bob cannot determine the value of the bit without Alice’s help. (2) Alice cannot change the bit once she send it. Now, for each game, Alice sends a symbol b=1 if she predicts the team will win, a symbol b=0 if she predicts it will lose. After the game has been played, Alice reveals the bit to Bob.

  37. 4.3 Computing Discrete Logs Modulo 4

  38. 4.3 Computing Discrete Logs Modulo 4 (Continued)

  39. 4.3 Computing Discrete Logs Modulo 4 (Continued)

  40. 4.4 A Bit Commitment Scheme

  41. Thank You!

More Related