Login / Signup
The Discrete Logarithm problem in the ElGamal cryptosystem over the abelian group U(n) Where n= p^m, or 2p^m.
Hayder Raheem Hashim
Published in:
CoRR (2014)
Keyphrases
</>
elliptic curve
cellular automata
scalar multiplication
neural network
key management
artificial intelligence
information systems
end to end
signature scheme
power analysis
group membership