The Discrete Logarithm problem in the ElGamal cryptosystem over the
abelian group U(n) Where n= p^m,or 2p^m

The Discrete Logarithm problem in the ElGamal cryptosystem over the abelian group U(n) Where n= p^m,or 2p^m

18 April 2014

ArXiv (abs)PDF HTML

Papers citing "The Discrete Logarithm problem in the ElGamal cryptosystem over the abelian group U(n) Where n= p^m,or 2p^m"

Title
No papers found