A reinforced elgamal scheme proposal against a pohlig-hellman attack

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

Resumen

Multiplicative group (G, .) where G = Z*p = Zp -{0}, the primitive element calculation, say α, is usually constructed from the following theorem: given a prime p ≥ 2 and α ∈ Zp, which is a primitive or generator element of Z*p if and only if α(p-1)/q ≠ 1 mod p, ∀ prime q such that q | (p - 1). Furthermore, the Dirichlet theorem shows that: given two integers a, b with gcd(a, b) = 1, that is, a, b are relatively prime to each other, then, an infinite number of primes can be constructed in accordance with the formula n(a) + b, where n = 1, 2, . . . . In this work high primality has the following meaning: given a number p ≥ 2, it is said to be prime with an error at most 1/2100. Now, using the two theorems cited above and taking as particular values b = 1 and a = p1p2 where p1, p2, are two high primality numbers; a high primality number p can be built which has the form p = (m)p1p2 + 1. with m = 2n for n = 1, 2, . . . , eliminating those that fulfill p = 0 mod 5. To construct positive integers p-form with high-primality intents that p - 1 can be factorized in a simple way. This research produced 700000 positive p-form integers. The result is that 88.5% of them have a m less or equal to 2000; it is pointed out that p1, p2 are 10200 approximately. Then, one can obtain a primitive α easily, and also a double lock is provided with regard to a Pohlig-Hellman form attack. The first one is the p -1 factorization and the second, solving the discrete logarithm problem when the p - 1 factors are known.

Idioma originalInglés
Páginas (desde-hasta)2909-2916
Número de páginas8
PublicaciónApplied Mathematical Sciences
Volumen7
N.º57-60
DOI
EstadoPublicada - 2013

Huella

Profundice en los temas de investigación de 'A reinforced elgamal scheme proposal against a pohlig-hellman attack'. En conjunto forman una huella única.

Citar esto