L. Blum, M. Blum, and M. Shub: A simple secure unpredictable pseudorandom number generator, SIAM Journal on Computing, volume 15, issue 2, pp. 364-383. ACM Press, May 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Generalization of Paillier's Public-Key System with.. - Damgard, Jurik, Nielsen (2003) (2 citations) (Correct)
....s by a random element from the coset (1 n) # s (i, Z # n ) This element is chosen as c = # s (i, r) for random r Z # n . Note that if we reduce a ciphertext modulo n, we obtain: c mod n = 1 n) The Jacobi symbol modulo n is easy to compute, even without the factors (see e.g. [2]) and since n is odd and the Jacobi symbol is multiplicative, we see that from c = # s (i, r) we can compute the Jacobi symbol of r e#ciently. Further, by multiplying c by a number of form # s (0, r) where r is an arbitrary constant with the same Jacobi symbol as r, we obtain a ciphertext ....
L. Blum, M. Blum, and M. Shub: A simple secure unpredictable pseudo-random number generator, SIAM Journal on Computing, 15(2): pp. 364-383, May 1986.
Extensions to the Paillier Cryptosystem with Applications to.. - Jurik (2003) (Correct)
No context found.
L. Blum, M. Blum, and M. Shub: A simple secure unpredictable pseudorandom number generator, SIAM Journal on Computing, volume 15, issue 2, pp. 364-383. ACM Press, May 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC