Polynomial representations of the Lucas logarithm
From MaRDI portal
The authors provide results that are of interest for cryptosystems depending on the discrete logarithm problem. They look at the intractability of the so-called Lucas problem, which turns out to be computationally equivalent to the discrete logarithm problem over finite fields \(\mathbb F_{p^2}\). Moreover, they provide precise formulas for polynomials representing the Lucas algorithm. They also develop lower bounds on the degree of interpolation polynomials for the Lucas logarithm with respect to subsets of given data.
Recommendations
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- Polynomial interpolation of the discrete logarithm
- Polynomial Interpolation of the k-th Root of the Discrete Logarithm
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Number theoretic methods in cryptography. Complexity lower bounds
Cites work
- A note on discrete logarithms in finite fields
- A note on the interpolation of the Diffie-Hellman mapping
- A polynomial representation for logarithms in GF(q)
- A polynomial representation of the Diffie-Hellman mapping
- A short proof for explicit formulas for discrete logarithms in finite fields
- Coding and Cryptography
- Cryptanalysis of the Dickson-Scheme
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- scientific article; zbMATH DE number 2127885 (Why is no real title available?)
- scientific article; zbMATH DE number 3748927 (Why is no real title available?)
- scientific article; zbMATH DE number 611186 (Why is no real title available?)
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- scientific article; zbMATH DE number 1024494 (Why is no real title available?)
- scientific article; zbMATH DE number 1030971 (Why is no real title available?)
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- scientific article; zbMATH DE number 1982615 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2089968 (Why is no real title available?)
- Incomplete character sums and polynomial interpolation of the discrete logarithm
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Linear complexity of the discrete logarithm
- Lower bounds on the linear complexity of the discrete logarithm in finite fields
- Number theoretic methods in cryptography. Complexity lower bounds
- On cyclotomic generator of order \(r\).
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- On the security of the Lucas function
- Permutation polynomials in RSA-cryptosystems
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
- Polynomial interpolation of the discrete logarithm
- Polynomial representations of the Diffie-Hellman mapping
Cited in
(4)
This page was built for publication: Polynomial representations of the Lucas logarithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500606)
