The following pages link to (Q3360980):
Displayed 10 items.
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- On the security of the Lucas function (Q673987) (← links)
- Applying quick exponentiation for block upper triangular matrices (Q865509) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
- A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Nonabelian sets with distinct \(k\)-sums (Q1903729) (← links)
- Analysis and design of a secure key exchange scheme (Q2390334) (← links)