An Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups

@inproceedings{Mihalcik2010AnAO,
  title={An Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups},
  author={Joseph P. Mihalcik},
  year={2010}
}
  • Joseph P. Mihalcik
  • Published 2010
Internet protocols such as Secure Shell and Internet Protocol Security rely on the assumption that finding discrete logarithms is hard. The protocols specify fixed groups for DiffieHellman key exchange that must be supported. Although the protocols allow flexibility in the choice of group, it is highly likely that the specific groups required by the standards will be used in most cases. There are security implications to using a fixed group, because solving any discrete logarithm within a group… CONTINUE READING