Finding discrete logarithm in F_p^*

by   Rajeev Kumar, et al.

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field F_p^*. Pohlig-Hellman method does yield good results if p is smooth ( i.e. p-1 has small prime factors). We propose a practical alternative to Pohlig-Hellman algorithm for finding discrete logarithm modulo prime. Although, proposed method, similar to Pohlig-Hellman reduces the problem to group of orders p_i for each prime factor and hence in worst case scenario (including when p=2q+1 , q being another prime) order of run time remains the same. However in proposed method, as there is no requirement of combining the result using Chinese Remainder Theorem and do the other associated work ,run times are much faster.



page 1

page 2

page 3

page 4


An improvement to a result about graph isomorphism networks using the prime factorization theorem

The unique prime factorization theorem is used to show the existence of ...

On the ideal shortest vector problem over random rational primes

Any ideal in a number field can be factored into a product of prime idea...

Further factorization of x^n-1 over finite fields (II)

Let F_q be a finite field with q elements. Let n be a positive integer w...

Primality Tests and Prime Certificate

This note presents a formalisation done in Coq of Lucas-Lehmer test and ...

On Chebotarëv's nonvanishing minors theorem and the Biró-Meshulam-Tao discrete uncertainty principle

Chebotarëv's theorem says that every minor of a discrete Fourier matrix ...

Random primes in arithmetic progressions

We describe a straightforward method to generate a random prime q such t...

A new idea for RSA backdoors

This article proposes a new method to inject backdoors in RSA and other ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.