6 Conclusions
We set out to build a public key cryptosystem by repeatedly substituting for variables in multivariate polynomials and simplifying the results to conceal the substitution process. There seems, however, to be no way to build such a system that is both secure and has a public key of practical size when the devices used to limit the number of coefficeints are nilpotence and J-rings. We have only shown, however, that it is impossible to produce such a system if the total degree of the encryption polynomial determines the size of the public key. Perhaps, by properly choosing p 0 and p 1, we can employ the fundamental scheme to produce sparse encrypting polynomials. Then the public key could be kept small while the encrypting polynomial bas large total degree and is difficult to invert.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Don Coppersmith and Edna Grossman, “Generators for Certain Alternating Groups with Applications to Cryptography,” SIAM J. Appl. Math., Vol. 29, No. 4, pp. 624–627, Dec 1975.
Whitfield Diffie and Martin E. Hellman, “New Directions in Cryptography,” IEEE Trans. Info. Thy., Vol. IT-22, No. 6, pp. 644–654, November 1976.
Data Encryption Standard, FIPS Pub. No. 46, National Bureau of Standards, 15 January 1977.
Solomon W. Golomb, Shift Register Sequences, Holden Day, San Francisco, 1967.
R. McLeice, A Public-Key Cryptosystem Based On Albebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Lab, Calif. Inst. of Tech., Pasadina CA, Jan–Feb 1978.
R. C. Merkle and M. E. Hellman, “Hiding Information and Signatures in Trapdoor Knapsacks,” IEEE Transactions on Information Theory, Vol. IT-24, No. 5, pp. 525–530, September 1978.
R. L. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” CACM, Vol. 21, No. 2, pp. 120–126, February 1978.
Gustavus J. Simmons. Personal Communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fell, H., Diffie, W. (1986). Analysis of a Public Key Approach Based on Polynomial Substitution. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive