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 ...
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...