The Newton Channel
نویسندگان
چکیده
Simmons asked whether there exists a signature scheme with a broadband covert channel that does not require the sender to compromise the security of her signing key. We answer this question in the affirmative; the ElGamal signature scheme has such a channel. Thus, contrary to popular belief, the design of the DSA does not maximise the covert utility of its signatures, but minimises them. Our construction also shows that many discrete log based systems are insecure: they operate in more than one group at a time, and key material may leak through those groups in which discrete log is easy. However, the DSA is not vulnerable in this way.
منابع مشابه
Asymptotic Behavior of the Newton-Boussinesq Equation in a Two-Dimensional Channel
We prove the existence of a global attractor for the Newton-Boussinesq equation defined in a two-dimensional channel. The asymptotic compactness of the equation is derived by the uniform estimates on the tails of solutions. We also establish the regularity of the global attractor.
متن کاملAdaptive multi-channel least mean square and Newton algorithms for blind channel identification
The problem of identifying a single-input multiple-output FIR system without a training signal, the so-called blind system identi&cation, is addressed and two multi-channel adaptive approaches, least mean square and Newton algorithms, are proposed. In contrast to the existing batch blind channel identi&cation schemes, the proposed algorithms construct an error signal based on the cross relation...
متن کاملCdma Blind Channel Equalization: a Weighted Subspace Approach
This paper considers the problem of blind demodulation of multiuser information symbols in a direct-sequence code-division multiple access (DSCDMA) environment. Channel estimation and symbol detection in presence of both multiple access interference (MAI) and intersymbol interference (ISI) is carried out with second order statistics methods from the received data. This problem is similar to Dir...
متن کاملOn the Behavior of Damped Quasi-Newton Methods for Unconstrained Optimization
We consider a family of damped quasi-Newton methods for solving unconstrained optimization problems. This family resembles that of Broyden with line searches, except that the change in gradients is replaced by a certain hybrid vector before updating the current Hessian approximation. This damped technique modifies the Hessian approximations so that they are maintained sufficiently positive defi...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملMaximum Likelihood Algorithms using Iterative Maximization Methods for Joint Estimation in MIMO OFDM Systems
A Modern wireless broadband system of MIMO OFDM (multiple input multiple output orthogonal frequency division multiplexing) is more popular because of good data transmission rate, robustness against multipath fading and better spectral efficiency. This system provides reliable communication and wider coverage. A main challenge to MIMO OFDM system is the retrieval of channel state information (C...
متن کامل