Pages that link to "Item:Q5187374"

The following pages link to A polynomial representation for logarithms in GF(q) (Q5187374):

Displaying 16 items.

• A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
• Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
• Closed formulae for the Weil pairing inversion (Q938771) (← links)
• A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
• Aitken and Neville inverse interpolation methods for the Lucas logarithm problem (Q1008623) (← links)
• A note on discrete logarithms in finite fields (Q1196517) (← links)
• On certain summation problems and generalizations of Eulerian polynomials and numbers (Q1300978) (← links)
• Incomplete character sums and polynomial interpolation of the discrete logarithm (Q1609397) (← links)
• Carlitz rank and index of permutation polynomials (Q1679707) (← links)
• Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (Q2489927) (← links)
• Polynomial representations of the Lucas logarithm (Q2500606) (← links)
• Transformations of Cryptographic Schemes Through Interpolation Techniques (Q2790421) (← links)
• Interpolation of the Double Discrete Logarithm (Q3519547) (← links)
• (Q4882704) (← links)
• Eulerian fractions and Stirling, Bernoulli and Euler functions with complex order parameters and their impact on the polylogarithm function (Q6169400) (← links)