Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
AlgorithmBaby-step giant-stepDiffie–Hellman key exchangeDiscrete logarithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Performance and Security of ECDSA
Digital signatures are used world wide to verify the authenticity of messages and confirm that they have not been altered in… 
Highly Cited
2012
Highly Cited
2012
Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images
2010
2010
Implementation of 8-point Slantlet transform based polynomial cancellation coding-OFDM system using FPGA
The objective of this paper is to implement a baseband OFDM transceiver on FPGA hardware. The design uses 8-point SLT/ISLT… 
Highly Cited
2009
Highly Cited
2009
Privacy-Preserving Content-Based Publish/Subscribe Networks
Privacy and confidentiality are crucial issues in content-based publish/subscribe (CBPS) networks. We tackle the problem of end… 
2008
2008
Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
  • Felix Fontein
  • Advances in Mathematics of Communications
  • 2008
  • Corpus ID: 60298
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem… 
2008
2008
Elliptic Curve Pohlig-Hellman Algorithm
  • Qi Rong
  • International Conference on Computer and…
  • 2008
  • Corpus ID: 64411581
This paper described correlative concepts of Elliptic Curve Cryptography(ECC).And on the basis of making a study of Elliptic… 
Review
2007
Review
2007
Introduction to Modern Cryptography
Preface I. Introduction and Classical Cryptography Introduction Cryptography and Modern Cryptography The Setting of Private-Key… 
1999
1999
The Pohlig-Hellman Method Generalized for Group Structure Computation
  • Edlyn Teske
  • Journal of symbolic computation
  • 1999
  • Corpus ID: 10940089
We present a new algorithm that extends the techniques of the Pohlig?Hellman algorithm for discrete logarithm computation to the… 
Highly Cited
1996
Highly Cited
1996
On Diffie-Hellman Key Agreement with Short Exponents
The difficulty of computing discrete logarithms known to be "short" is examined, motivated by recent practical interest in using… 
1993
1993
A serial version of the Pohlig-Hellman Algorithm for computing discrete logarithms
We describe a method for computing discrete logarithms in any nonsimple cyclic group, which may be considered as a serial version… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)