We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
In this paper we propose and test an action recognition algorithm in which the images of the scene captured by a significant number of cameras are first used to generate a volumet...
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...