Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Pohlig–Hellman algorithm

Known as: Pohlig-Hellman algorithm, Pohlig-Hellman, Pohlig-Hellman system 
In number theory, the Pohlig–Hellman algorithm sometimes credited as the Silver–Pohlig–Hellman algorithm is a special-purpose algorithm for computing… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Digital signatures are used world wide to verify the authenticity of messages and confirm that they have not been altered in… Expand
  • table II
  • table III
  • table I
  • table IV
  • table V
2013
2013
AES (Advanced Encryption Standard) is widely used in LTE and Wi-Fi communication systems. AES has recently been exposed to new… Expand
  • figure 1
Highly Cited
2012
Highly Cited
2012
This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for… Expand
Highly Cited
2009
Highly Cited
2009
Privacy and confidentiality are crucial issues in content-based publish/subscribe (CBPS) networks. We tackle the problem of end… Expand
  • table 1
  • table 2
  • table 3
2008
2008
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem… Expand
Highly Cited
2008
Highly Cited
2008
In this paper we present a new kind of cryptanalytic attack which utilizes bugs in the hardware implementation of computer… Expand
2008
2008
This paper described correlative concepts of Elliptic Curve Cryptography(ECC).And on the basis of making a study of Elliptic… Expand
1999
1999
  • E. Teske
  • J. Symb. Comput.
  • 1999
  • Corpus ID: 10940089
We present a new algorithm that extends the techniques of the Pohlig?Hellman algorithm for discrete logarithm computation to the… Expand
Highly Cited
1996
Highly Cited
1996
The difficulty of computing discrete logarithms known to be "short" is examined, motivated by recent practical interest in using… Expand
1982
1982
At the 1981 IEEE Symposium on Information Theory, T. Herlestam and R. Johannesson presented a heurestic method for computing… Expand