On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping

DOI10.1017/S0004972700036042zbMath1070.11055OpenAlexW2049875011WikidataQ59163787 ScholiaQ59163787MaRDI QIDQ4824817

Arne Winterhof, Eike Kiltz

Publication date: 1 November 2004

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700036042

zbMATH Keywords

interpolationcryptographyDiffie-Hellman problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Zero testing and equation solving for sparse polynomials on rectangular domains ⋮ Interpolation of the Double Discrete Logarithm ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Polynomial representations of the Lucas logarithm ⋮ On the index of the Diffie-Hellman mapping ⋮ On Polynomial Interpolations related to Verheul Homomorphisms

Cites Work

• Number theoretic methods in cryptography. Complexity lower bounds
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• A polynomial representation of the Diffie-Hellman mapping
• Elliptic Curve Cryptosystems
• Unnamed Item
• Unnamed Item

This page was built for publication: On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping