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.
2018
2018
Applied Pohlig-Hellman algorithm in three-pass protocol communication
Three-pass Protocol is a method or technique that can be used by 2 (two) sender and recipient of the message to communicate with… 
2015
2015
Pohlig-Hellman Applied in Elliptic Curve Cryptography
The Pohlig-Hellman algorithm is an algorithm that solves the discrete logarithm problem. The algorithm simplifies the problem by… 
2013
2013
Attacks and countermeasures on AES and ECC
AES (Advanced Encryption Standard) is widely used in LTE and Wi-Fi communication systems. AES has recently been exposed to new… 
2012
2012
A Curve Choosing Algorithm and Its Distributed Improvement of ECC with Fixed Order on Binary Field
In the elliptic curve cryptosystem (ECC), curve choosing directly affect the various factors of ECC, such as the speed of… 
2011
2011
A Small Subgroup Attack for Recovering Ephemeral Keys in Chang and Chang Password Key Exchange Protocol
Three-party authenticated key exchange protocol is an important cryptographic technique in the secure communication areas… 
2008
2008
Elliptic Curve Pohlig-Hellman Algorithm
This paper described correlative concepts of Elliptic Curve Cryptography(ECC).And on the basis of making a study of Elliptic… 
2007
2007
Atac al problema del logaritme discret mitjançant l'algorisme de Pohlig-Hellman
En els darrers anys, l'us de les corbes el·liptiques en criptografia basada en el problema del logaritme discret s'ha anat… 
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… 
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… 
1982
1982
Some remarks on the Herlestam-Johannesson algorithm for computing logarithms over GF(2/sup P/). [Potential threat to Pohlig-Hellman Cryptosystem]
At the 1981 IEEE Symposium on Information Theory, T. Herlestam and R. Johannesson presented a heurestic method for computing… 
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)