Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,933,925 papers from all fields of science
Search
Sign In
Create Free Account
Pohlig–Hellman algorithm
Known as:
Pohlig-Hellman algorithm
, Pohlig-Hellman
, Pohlig-Hellman system
Expand
In number theory, the Pohlig–Hellman algorithm sometimes credited as the Silver–Pohlig–Hellman algorithm is a special-purpose algorithm for computing…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algorithm
Baby-step giant-step
Diffie–Hellman key exchange
Discrete logarithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Pohlig-Hellman Applied in Elliptic Curve Cryptography
M. Sommerseth
2015
Corpus ID: 17195873
The Pohlig-Hellman algorithm is an algorithm that solves the discrete logarithm problem. The algorithm simplifies the problem by…
Expand
2015
2015
Analisis Algoritma Baby-Step Giant-Step dan Pohlig-Hellman untuk Menyelesaikan Masalah Logaritma Diskrit
Etty Winita Roiska Simbolon
2015
Corpus ID: 124718359
2015
2015
Distributed Multi-user, Multi-key Searchable Encryptions Resilient Fault Tolerance
Hua-Fei Zhu
International Conference on Trusted Systems
2015
Corpus ID: 2610873
In this paper, a construction of distributed multi-user, multi-key searchable encryptions is proposed and analyzed. Our scheme…
Expand
2013
2013
Analisis dan Perancangan Aplikasi Pengamanan Pesan Dengan Pohlig-Hellman Cryptosystem dan Metode End Of File
Nidia Enjelita Saragih
2013
Corpus ID: 60426081
2011
2011
A Small Subgroup Attack for Recovering Ephemeral Keys in Chang and Chang Password Key Exchange Protocol
R. Padmavathy
,
C. Bhagvati
Journal of Computers
2011
Corpus ID: 12153627
Three-party authenticated key exchange protocol is an important cryptographic technique in the secure communication areas…
Expand
2008
2008
Elliptic Curve Pohlig-Hellman Algorithm
Q. 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…
Expand
2007
2007
Atac al problema del logaritme discret mitjançant l'algorisme de Pohlig-Hellman
D. Sabaté
2007
Corpus ID: 123294566
En els darrers anys, l'us de les corbes el·liptiques en criptografia basada en el problema del logaritme discret s'ha anat…
Expand
2004
2004
PARELEPHAS IN RELATION TO PHYLA AND GENERA OF THE FAMILY ELEPHANTIDA
Museum Novitates
,
AmERICAN Museum
,
obNATURAL HisroRY
2004
Corpus ID: 56001064
The GENUS of Linnawus comprises a contemporaneous group of species, e.g., Felis. The phylogenetic genus of Osborn comprises a…
Expand
1993
1993
A serial version of the Pohlig-Hellman Algorithm for computing discrete logarithms
J. A. Thiong Ly
1993
Corpus ID: 195072772
We describe a method for computing discrete logarithms in any nonsimple cyclic group, which may be considered as a serial version…
Expand
1982
1982
Some remarks on the Herlestam-Johannesson algorithm for computing logarithms over GF(2/sup P/). [Potential threat to Pohlig-Hellman Cryptosystem]
E. F. Brickell
,
J. H. Moore
1982
Corpus ID: 117807327
At the 1981 IEEE Symposium on Information Theory, T. Herlestam and R. Johannesson presented a heurestic method for computing…
Expand