Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stephen C. Pohlig

dblp:134/5227 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
discrete logarithm
0.011978
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) · IEEE Trans. Inf. Theory 1978
Cryptographic primitives and cryptanalysis › public-key cryptography
discrete-log based cryptosystems
0.011978
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) · IEEE Trans. Inf. Theory 1978
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption
0.011978
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) · IEEE Trans. Inf. Theory 1978

Methods — techniques the papers use, named apart from their topics

number-theoretic algorithms · 0.0index calculus · 0.0
YearPublicationVenuePosition
1988 Hybrid adaptive feedback nulling in the presence of channel mismatch
abstract
Nulling systems often consist of a main channel and one or more auxiliary channels. In such systems, the degree of nulling achieved is often limited by mismatched frequency responses between the auxiliary channels and the main channel. The hybrid feedback technique is shown to compensate for this mismatch by enclosing the mismatched receiver components inside an adaptive feedback loop.>
Stephen C. Pohlig
ICASSP1
1981 A nested algorithm for improving the accuracy of chirp-Fourier transform implementations
abstract
The chirp Z-transform permits large bandwidth (i.e. high speed) analog devices to be used to compute the Discrete Fourier Transform (DFT). Such Implementations are often faster and/or smaller than all digital Fast Fourier Transforms (FFT's), but suffer from accuracy limitations imposed by the analog devices. In this paper, we present a nested algorithm that permits excess bandwidth of the analog device to be exploited in order to compute the DFT more accurately. The nested structure can be realized with a single analog device, and can be trained to the errors associated with the device. Algorithm performance is verified through computer simulations in which DFT accuracy is limited due to fixed tap weight errors in the FIR filter portion of the chirp Z-transform.
Stephen C. Pohlig, Gary A. Shaw, Theodore Bially, Thomas F. Quatieri
ICASSP1
1979 Phase in speech and pictures
abstract
It is generally known that preservation of phase information in images is important as evidenced by the fact that modifying an image such that phase is preserved but the magnitude of all the spectral components is set to unity generally preserves many of the features of the original image. A similar experiment has been carried out with speech, showing that preservation of only the long-time phase retains many important features of the original speech. An interpretation of these results, and their potential application to blind deconvolution, is suggested.
Alan V. Oppenheim, Jae S. Lim, Gary E. Kopec, Stephen C. Pohlig
ICASSP4
1978 An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
abstract
A cryptographic system is described which is secure if and only if computing logarithms overGF(p)is infeasible. Previously published algorithms for computing this function requireO(p^{1/2})complexity in both time and space. An improved algorithm is derived which requiresO =(\log^{2} p)complexity ifp - 1has only small prime factors. Such values ofpmust be avoided in the cryptosystem. Constructive uses for the new algorithm are also described.
Stephen C. Pohlig, Martin E. Hellman
IEEE Trans. Inf. Theory1