Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
Abstract. This paper analyzes the problem of secure document management and distribution in an open network environment. Reader and author authentication, document integrity, origi...
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...