Pages that link to "Item:Q1276548"
From MaRDI portal
The following pages link to Number theoretic methods in cryptography. Complexity lower bounds (Q1276548):
Displayed 11 items.
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- Incomplete character sums and polynomial interpolation of the discrete logarithm (Q1609397) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (Q2489927) (← links)
- Polynomial representations of the Lucas logarithm (Q2500606) (← links)
- Polynomial representations of the Diffie-Hellman mapping (Q2730746) (← links)
- A note on the interpolation of the Diffie-Hellman mapping (Q2777722) (← links)
- On a family of preimage-resistant functions (Q3075868) (← links)
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping (Q4824817) (← links)
- On the statistical properties of Diffie-Hellman distributions (Q5932009) (← links)
- A lower bound for primality (Q5943093) (← links)