Skip to main content

Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes

  • Conference paper
Advances in Cryptology
  • 696 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  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.’82

    Google 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer Science+Business Media New York

About this paper

Cite this paper

Avis, G.M., Tavares, S.E. (1983). Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-0602-4_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-0604-8

  • Online ISBN: 978-1-4757-0602-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics