Polynomial representations of the Lucas logarithm
Copyright policy )Polynomial representations of the Lucas logarithm
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.
cryptography, Algebra and Number Theory, Dickson polynomials, polynomials, Applied Mathematics, Algebraic coding theory; cryptography (number-theoretic aspects), weight, Weight, Polynomials, degree, interpolation, Interpolation, Polynomials over finite fields, Theoretical Computer Science, Degree, Cryptography, Engineering(all), Lucas logarithm, dickson polynomials
cryptography, Algebra and Number Theory, Dickson polynomials, polynomials, Applied Mathematics, Algebraic coding theory; cryptography (number-theoretic aspects), weight, Weight, Polynomials, degree, interpolation, Interpolation, Polynomials over finite fields, Theoretical Computer Science, Degree, Cryptography, Engineering(all), Lucas logarithm, dickson polynomials
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!