Author:
Fischer Jean-Bernard,Stern Jacques
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alexi, W., Chor, B., Goldreich, O., Schnorr, C. P.: Rsa and rabin functions: certain parts are as hard as the whole. SIAM J. Computing 17 (1988) 194–209.
2. Berlekamp, E. R., McEliece, R. J., van Tilborg, H. C. A.:. On the inherent intractability of certain coding problems. In IEEE Trans. Information Theory (1978) IEEE pp. 384–386.
3. Blum, L., Blum, M., Shub, M.: A simple unpredictible pseudo-random number generator. SIAM J. Computing 15 (1986) 364–383.
4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing 13 (1984) 850–863.
5. Canteaut, A., Chabaud, F.:. A general improvement of the previous attacks on McEliece’s cryptosystem. Unpublished.
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献