FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2016
02419932016

Related topics

Related topics

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

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Pohlig–Hellman algorithm
Algorithm
Diffie–Hellman key exchange
List of algorithms
Discrete logarithm
Hyperelliptic curve cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Pohlig-Hellman Applied in Elliptic Curve Cryptography
  • Martin Lysoe
  • 2015
The Pohlig-Hellman algorithm is an algorithm that solves the discrete logarithm problem. The algorithm simplifies the problem by… (More)
  • figure 1
Is this relevant?
2014
2014
A new class of scalable parallel pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers
We propose a new class of pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers. The method generates… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
Let (G, ·) be an arbitrary cyclic group of composite order N with G ' G1×G2. We present a generic algorithm for solving the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem… (More)
Is this relevant?
2005
2005
Improving the Diffie-Hellman secure key exchange
Diffie-Hellman (DH) is a well-known cryptographic algorithm used for secure key exchange. The first appearance of DH was in 1976… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Privacy-Enhanced Searches Using Encrypted Bloom Filters
It is often necessary for two or more or more parties that do not fully trust each other to selectively share data. We propose a… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Algebraic Methods for Constructing One-way Trapdoor Functions
In this dissertation, we consider an extension of the discrete logarithm problem to the case of a semigroup acting on a finite… (More)
  • figure 1.4
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • table 5.1
Is this relevant?
2002
2002
Semirings and Semigroup Actions in Public-key Cryptography
  • Christopher J. Monico
  • 2002
by Christopher J. Monico In this dissertation, several generalizations of cryptographic protocols based on the Discrete Logarithm… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • table 3.1
  • table 3.2
Is this relevant?
1999
1999
The Pohlig-Hellman Method Generalized for Group Structure Computation
We present a new algorithm that extends the techniques of the Pohlig-Hellman algorithm for discrete logarithm computation to the… (More)
Is this relevant?
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… (More)
Is this relevant?