Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes
Computational efficiency is of prime importance to any micro-processor based cryptosystem. A technique is presented here which permits a reduction in the enciphering complexity of private key schemes without a loss in security. The net result can be a simplification of the system’s implementation, a reduction in cryptographic overhead and the potential for a simple mathematical analysis of the security system.
Unable to display preview. Download preview PDF.
- 1.Avis, G., “A MICROPROCESSOR BASED SECURE MESSAGE EXCHANGE SYSTEM”, M.Sc. Thesis, Dept. of Electrical Engineering, Queen’s University, Kingston, Ontario, Canada, June, 1982.Google Scholar
- 2.Akl, S., “ON DIGITAL SIGNATURES WITH BLINDFOLDED ARBITRATORS WHO CANNOT FORM ALLIANCES:, Proceedings of the 1982 Symposium on Security and Privacy, IEEE, Oakland, CA, Apr.’82Google Scholar
- 3.Davida, G., Well, D., Kam, J., “A DATABASE ENCRYPTION SCHEME WITH SUBKEYS”, ACM Trans. on Database Systems, Vol. 6, No. 2, June 1981.Google Scholar
- 4.DeMillo, R., “CRYPTOGRAPHIC PROTOCOLS”, American Math Society, Cryptography in Revolution: Mathematics and Models, Jan. 1981.Google Scholar
- 5.Kowalchuk, J., Schanning, B. and Powers, S., “COMMUNICATIONS PRIVACY: INTEGRATION OF PUBLIC AND SECRET KEY CRYPTOGRAPHY”, MITRE Corp., Bedford, MA, June 1980.Google Scholar
- 6.Lau, Y. and McPherson, T., “THEIMPLEMENTATION OF A HYBRID RSA/DES KEY MANAGEMENT SYSTEM”, CRYPTO ‘81, UCSB, CA, Aug. 1981.Google Scholar
- 7.Rivest, R., Shamir, A. and Adleman, L., “A METHOD FOR OBTAINING DIGITAL SIGNATURES AND PUBLIC KEY CRYPTOSYSTEMS”, Comm. of the ACM, Vol. 21, No.2.Google Scholar
- 8.Spencer, M. and Tavares, S. “LAYERED ENCRYPTION APPLIED TO BROADCAST SYSTEMS”, Dept. of E.E., Queen’s University, Kingston, Ontario, Canada, Feb. 1982.Google Scholar