论文信息 - Cryptographically Strong Sequences Of Pseudo Random Bits - 字舞流文

Cryptographically Strong Sequences Of Pseudo Random Bits

Silvio Micali | Manuel Blum | S. Micali | M. Blum

[1] Adi Shamir,et al. On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[2] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3] Joan B. Plumstead. Inferring a sequence generated by a linear congruence , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4] Silvio Micali,et al. Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

[5] Adi Shamir,et al. On the Generation of Cryptographically Strong Pseudo-Random Sequences , 1981, ICALP.

[6] Leonard M. Adleman,et al. A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).