1. Diffie, W. and Hellman, M.E., “New directions in cryptography,” IEEE Transactions on Information Theorey, IT-22,6, pp.644–654, (Nov. 1976).
2. Cardoza, E., Lipton, R. and Meyer, A.R., “Exponential space complete problems for Petri nets and commutative semigroups,” Conf. Record of the 8th Annual ACM Symposium on Theory of Computing, pp.50–54, (1976).
3. Garey, M.R. and Johnson, D.S., Computer and Intractability: A guide to the theory of NP-comptleteness, Freeman, (1979).
4. Matsumoto, T., Imai, H., Harashima, H. and Miyakawa, H., “A class of asymmetric cryptosystems using obscure representations of enciphering functions,” 1983 National Convention Record on Information Systems, IECE Japan, S8–5, (Sept. 1983) (in Japanese).
5. Matsumoto, T., Harashima, H. and Imai, H., “A theory of constructing multivariate-polynomial-tuple asymmetric cryptosystems,” Proceedings of 1986 Symposium on Cryptography and Information Security, E2, Susono, Japan, (Feb. 1986) (in Japanese).