CHAPTER 14
THE DISCRETE LOGARITHM PROBLEM
THE CRYPTOGRAPHIC strength of the RSA algorithm appears to depend on the computational infeasibility of factoring very large numbers. This chapter describes the discrete logarithm problem (DLP), which is intimately related to both factoring and the problem of key exchange. Several solution methods will be described.
Get Computer Security and Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
