Pages that link to "Item:Q802668"
From MaRDI portal
The following pages link to A short proof for explicit formulas for discrete logarithms in finite fields (Q802668):
Displayed 11 items.
- 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)
- A note on discrete logarithms in finite fields (Q1196517) (← links)
- Incomplete character sums and polynomial interpolation of the discrete logarithm (Q1609397) (← 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)
- Construction of logarithm tables for Galois Fields (Q3069685) (← links)
- On Polynomial Interpolations related to Verheul Homomorphisms (Q3430823) (← links)
- Interpolation of the Double Discrete Logarithm (Q3519547) (← links)