RSA AND RABIN FUNCTIONS - CERTAIN PARTS ARE AS HARD AS THE WHOLE

[1] Alexi W., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P449, DOI 10.1109/SFCS.1984.715947

[2] BENOR M, 1983, 15TH P ACM S THEOR C, P421

[3] A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 364 - 383

[4] HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (04) : 850 - 864

[5] BLUM M, 1982, SPR IEEE COMCON

[6] BLUM M, 1985, ADV CRYPTOLOGY, P288

[7] BRENT RP, 1983, SYSTOLIC VLSI ARRAYS, P145

[8] CHOR B, 1986, ADV CRYPTOLOGY, P448

[9] CHOR B, 1986, 2 ISSUES PUBLIC KEY

[10] CHOR B, 1985, ADV CRYPTOLOGY, P303

[1] Alexi W., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P449, DOI 10.1109/SFCS.1984.715947

[2] BENOR M, 1983, 15TH P ACM S THEOR C, P421

[3] A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 364 - 383

[4] HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (04) : 850 - 864

[5] BLUM M, 1982, SPR IEEE COMCON

[6] BLUM M, 1985, ADV CRYPTOLOGY, P288

[7] BRENT RP, 1983, SYSTOLIC VLSI ARRAYS, P145

[8] CHOR B, 1986, ADV CRYPTOLOGY, P448

[9] CHOR B, 1986, 2 ISSUES PUBLIC KEY

[10] CHOR B, 1985, ADV CRYPTOLOGY, P303