Abstract
This paper discusses an asymmetric cryptosystem C* which consists of public transformations of complexity O(m 2 n 3) and secret transformations of complexity O((mn)2(m + logn)), where each complexity is measured in the total number of bit-operations for processing an mn-bit message block. Each public key of C* is an n-tuple of quadratic n-variate polynomials over GF(2m) and can be used for both verifying signatures and encrypting plaintexts. This paper also shows that for C* it is practically infeasible to extract the n-tuple of n-variate polynomials representing the inverse of the corresponding public key.
Chapter PDF
Similar content being viewed by others
References
Diffie, W. and Hellman, M.E., “New directions in cryptography,” IEEE Transactions on Information Theorey, IT-22,6, pp.644–654, (Nov. 1976).
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).
Garey, M.R. and Johnson, D.S., Computer and Intractability: A guide to the theory of NP-comptleteness, Freeman, (1979).
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).
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).
Fell, H. and Diffie, W., “Analysis of a public key approach based on polynomial substitution,” Advances in Cryptology — CRYPTO’ 85, Springer, pp.340–349, (1986).
Zhou, T., “Boolean public key cryptosystem of the second order,” Journal of China Institute of Communications, Vo1.5, No.3, pp.30–37, (July 1984) (in Chinese).
Zhou, T., “A note on boolean public key cryptosystem of the second order,” Journal of China Institute of Communications, Vol.7, No.1, pp.85–92, (Jan. 1986) (in Chinese).
Lidle, R. and Niederreiter, H., Finite Fields, Addison-Wesley (1983).
Rivest, R.L., Shamir, A. and Adleman, L., “A mehtod of obtaing digital signatures and public key cryptosystems,” Communications of ACM, Vol.21, No.2, pp.120–126, (Feb.1978).
Takahashi, I., “Switching functions constructed by Galois extension fields,” Information and Control, Vol.48, pp.95–108, (1983).
Matsumoto, T., Imai, H., Harashima, H. and Miyakawa, H., “A cryptographically useful theorem on the connection between uni and multivariate polynomials,” Transactions of the Institute of Electronics and Communication Engineers, Vol.E68, No.3, pp.139–146, (March 1985).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsumoto, T., Imai, H. (1988). Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_39
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive