1 / 82

Lecture 11-12 Implementations

Lecture 11-12 Implementations.

Download Presentation

Lecture 11-12 Implementations

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 11-12 Implementations

  2. The efficiency of a particular cryptographic scheme based on any one of the algebraic structures will depend on a number of factors, such as parameter size, time-memory tradeoffs, processing power available, software and/or hardware optimization, and mathematical algorithms. This lecture is concerned primarily with mathematical algorithms for efficiently carrying out computations in the underlying algebraic structure.

  3. The algorithms described in this lecture are those which, for the most part, have received considerable attention in the literature. Although some attempt is made to point out their relative merits, no detailed comparisons are given.

  4. Outline • Prime Number Issue • Exponentiation • Exponent Recoding • Multi-Exponentiation • Chinese Remainder Theorem for RSA • Montgomery Reduction Method

  5. 1 Prime Number Issue

  6. 1.1 Miller-Rabin Test

  7. 1.1 Miller-Rabin Test (Continued)

  8. 1.1 Miller-Rabin Test (Continued)

  9. 1.1 Miller-Rabin Test (Continued)

  10. 1.1 Miller-Rabin Test (Continued)

  11. 1.1 Miller-Rabin Test (Continued)

  12. 1.1 Miller-Rabin Test (Continued)

  13. 1.1 Miller-Rabin Test (Continued)

  14. 1.2 Prime Number Generation Prime number generation differs from primality testing as before, but may and typically does involve the latter. The former allows the construction of candidates of a fixed form which may lead to more efficient testing than possible for random candidates.

  15. 1.2.1 Random Search for Probable Primes

  16. 1.2.1 Random Search for Probable Primes (Continued)

  17. 1.2.1 Random Search for Probable Primes (Continued)

  18. 1.2.1 Random Search for Probable Primes (Continued)

  19. 1.2.1 Random Search for Probable Primes (Continued)

  20. 1.2.2 Strong Primes

  21. 1.2.2 Strong Primes (Continued)

  22. 1.2.2 Strong Primes (Continued)

  23. 1.2.3 Generating DSA Primes

  24. 1.2.3 Generating DSA Primes (Continued)

  25. 1.2.3 Generating DSA Primes (Continued)

  26. 1.2.3 Generating DSA Primes (Continued)

  27. 1.2.3 Generating DSA Primes (Continued)

  28. 2 Exponentiation

  29. 2.1 Problem Model 2.1.1 Addition Chains

  30. 2.1.2 Addition–Subtraction Chains

  31. 2.1.3 Addition Sequences and Vector Addition Chains

  32. 2.1.3 Addition Sequences and Vector Addition Chains (Continued)

  33. 2.1.3 Addition Sequences and Vector Addition Chains (Continued)

  34. 2.2 Techniques for General Exponentiation 2.2.1 The Binary Method

  35. 2.2.1 The Binary Method (Continued)

  36. 2.2.1 The Binary Method (Continued)

  37. 2.2.1 The Binary Method (Continued)

  38. 2.2.1 The Binary Method (Continued)

  39. 2.2.1 The Binary Method (Continued)

  40. 2.2.1The Binary Method (Continued)

  41. 2.2.2 k-ary Method

  42. 2.2.2 k-ary Method (Continued)

  43. 2.2.2 k-ary Method (Continued)

  44. 2.2.2 k-ary Method (Continued)

  45. 2.2.2 k-ary Method (Continued)

  46. 2.2.3 Sliding-Window Exponentiation

  47. 2.2.3 Sliding-Window Exponentiation (Continued)

  48. 2.3 Fixed-Exponent Exponentiation Algorithms There are numerous situations in which a number of exponentiations by a fixed exponent must be performed. Examples include RSA encryption and decryption, and ElGamal decryption.

  49. 2.3 Fixed-Exponent Exponentiation Algorithms (Continued)

More Related