Оцінка стійкості криптографічних протоколів заснованих на складності задачі дискретного логарифмування у скінченному полі GF ( p m )

Abstract

Were considered the mathematical operations, which underlie the asymmetric protocols of cryptographic resistance. Showing the research relevance of discrete logarithm methods in finite fields and also on elliptic curves defined over Galois fields. The research of discrete logarithm methods was made on the server computer. Based on the experimental studies were formulated the recommendations for choosing the discrete logarithm method in the field GF(p m ) and on the elliptical curve defined on it. Were defined the directions for further research in methods of discrete logarithm.