Author:
Wagner Neal R.,Magyarik Marianne R.
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. L. M. Adleman, “On breaking the iterated Merkle-Hellman public-key cryptosystem,” Advances in Cryptology: Proceedings of Crypto 82 ed by D. Chaum et al., Plenum, 1983, pp. 303–308.
2. A V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
3. M. Blum. “How to exchange (secret) keys,” ACM Transactions on Computer Systems 1,2 (May 1985). pp. 175–193.
4. W. W. Boone, “The word problem,” Annals of Math. 70 (1981), pp. 207–265.
5. G. Brassard, “A note on the complexity of cryptography,” IEEE Transactions on Information Theory, IT-25,2 (Mar. 1979), pp. 232–233.
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献