n Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups Joseph Mihalcik

ISBN:

Published:

Kindle Edition

63 pages


Description

n Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups  by  Joseph Mihalcik

n Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups by Joseph Mihalcik
| Kindle Edition | PDF, EPUB, FB2, DjVu, audiobook, mp3, RTF | 63 pages | ISBN: | 8.60 Mb

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 Diffie-Hellman key exchange that must be supported. Although the protocolsMoreInternet 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 Diffie-Hellman 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 is comparatively easier after a group-specific precomputation has been completed. In this work, we more accurately model real-world cryptographic applications with fixed groups. We use an analysis of algorithms to place an upper bound on the complexity of solving discrete logarithms given a group-specific precomputation.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "n Analysis of Algorithms for Solving Discrete Logarithms in Fixed Groups":


maratonciechocinek.pl

©2014-2015 | DMCA | Contact us