A. W. Schrift

Learn More
In this paper we consider the one-way function f g;N (X) = g X (modN), where N is a Blum integer. We prove that under the commonly assumed intractability of factoring Blum integers, all its bits are individually hard, and the lower as well as upper halves of them are simultaneously hard. As a result, f g;N can be used in eecient pseudo-random bit generators(More)
In this paper we consider the one-way function fg,N(X) = gX (modN) , where N is a Blum integer. We prove that under the commonly assumed intractabili ty of factoring Blum integers, almost all its bits are individually hard, and half of them are simultaneously hard. As a result, fg,N can be used in efficient pseudo-random bit generators and multi-bit(More)
The next bit test as introduced by Blum and Micali was shown by Yao to be a universal test for sources of unbiased independent bits. The aim of this paper is to provide a rigorous methodology for testing sources whose output distributions are not necessarily uniform. We first show that the natural extension of the next bit test, even in the simplest case of(More)
  • 1