Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
DOI10.1016/J.DAM.2005.03.030zbMATH Open1092.94024DBLPjournals/dam/KiltzW06OpenAlexW2090900392WikidataQ59163776 ScholiaQ59163776MaRDI QIDQ2489927FDOQ2489927
Authors: Eike Kiltz, Arne Winterhof 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.030
Recommendations
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- Coding and Cryptography
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- scientific article; zbMATH DE number 2089968
- Polynomial interpolation of the discrete logarithm
- Polynomial representations of the Diffie-Hellman mapping
- scientific article; zbMATH DE number 3941423
- A polynomial representation of the Diffie-Hellman mapping
- Polynomial approximation of bilinear Diffie-Hellman maps
Cryptography (94A60) Congruences; primitive roots; residue systems (11A07) Polynomials over finite fields (11T06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- Modern computer algebra
- Title not available (Why is that?)
- A polynomial form for logarithms modulo a prime (Corresp.)
- A polynomial representation for logarithms in GF(q)
- A short proof for explicit formulas for discrete logarithms in finite fields
- A note on discrete logarithms in finite fields
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- Polynomial representations of the Diffie-Hellman mapping
- A note on the interpolation of the Diffie-Hellman mapping
- Title not available (Why is that?)
- Polynomial interpolation of the discrete logarithm
- Prime divisors of sparse integers
- Incomplete character sums and polynomial interpolation of the discrete logarithm
- A polynomial representation of the Diffie-Hellman mapping
- Number theoretic methods in cryptography. Complexity lower bounds
- Title not available (Why is that?)
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- Title not available (Why is that?)
Cited In (19)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Transformations of cryptographic schemes through interpolation techniques
- Polynomial approximation of bilinear Diffie-Hellman maps
- Coding and Cryptography
- Complexity theoretic lower bounds on cryptographic functions.
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- Title not available (Why is that?)
- Coding and Cryptography
- Polynomial representations of the Lucas logarithm
- Polynomial interpolation of the Naor-Reingold pseudo-random function
- Cryptography through interpolation, approximation and computational intelligence methods
- Polynomial Interpolation of the k-th Root of the Discrete Logarithm
- Distribution and polynomial interpolation of the Dodis-Yampolskiy pseudo-random function
- Interpolation of the Double Discrete Logarithm
- Compact hierarchical identity-based encryption based on a Harder decisional problem
- Title not available (Why is that?)
- On the index of the Diffie-Hellman mapping
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
This page was built for publication: Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489927)
