Abstract
Recently, the first author introduced some cryptographic functions closely related to the Diffie–Hellman problem called P-Diffie–Hellman functions. We show that the existence of a low-degree polynomial representing a P-Diffie–Hellman function on a large set would lead to an efficient algorithm for solving the Diffie–Hellman problem. Motivated by this result we prove lower bounds on the degree of such interpolation polynomials. Analogously, we introduce a class of functions related to the discrete logarithm and show similar reduction and interpolation results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
