1 / 8

Handbook of Applied Cryptography - CH3, 3.6.3

Handbook of Applied Cryptography - CH3, 3.6.3. Kwang-Wook Yun 2017. 9.18. Agenda. 3.6.3 Pollard’s rho algorithm for logarithms. Introduction Algorithm pseudocode Example. 3.6.3 Introduction.

allsup
Download Presentation

Handbook of Applied Cryptography - CH3, 3.6.3

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. Handbook of Applied Cryptography- CH3, 3.6.3 Kwang-Wook Yun 2017. 9.18

  2. Agenda • 3.6.3 Pollard’s rho algorithm for logarithms • Introduction • Algorithm pseudocode • Example

  3. 3.6.3 Introduction • Pollard’s rho algorithm(Algorithm3.60) for computing discrete logarithms is a randomized algorithm with the same expected running time as the baby-step giant-step algorithm. • But, Pollard’s rho algorithm requires a negligible amount of storage. • it is far preferable to baby-step giant-step algorithm for problems of practical interest. For simplicity, it is assumed in this subsection that G is a cyclic group whose order n is prime.

  4. 3.6.3 Introduction

  5. 3.6.3 Algorithm pseudocode

  6. 3.6.3 Example

  7. 4.2.1 Fermat’s test • 4.11

  8. 참조 • Pollard’s rho algorithm for logarithms: https://en.m.wikipedia.org/wiki/Pollard%27s_rho_algorithm_for_logarithms

More Related