Low computational cost integrity for block ciphers

  • Authors:
  • José M. Sierra;Julio C. Hernández;Narayana Jayaram;Arturo Ribagorda

  • Affiliations:
  • IT Security Laboratory, University Carlos III of Madrid, Avd. de la Universidad 30, Leganés, Madrid 28911, Spain;IT Security Laboratory, University Carlos III of Madrid, Avd. de la Universidad 30, Leganés, Madrid 28911, Spain;School of Informatics and Multimedia Technology, University of North London, UK;IT Security Laboratory, University Carlos III of Madrid, Avd. de la Universidad 30, Leganés, Madrid 28911, Spain

  • Venue:
  • Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Encryption algorithms supply confidentiality to communications between parties. However, only under certain circumstances, encryption might also supply integrity validation. For those situations, where encryption algorithms do not supply any integrity protection, additional mechanisms must be implemented (hash functions, digital signature). In this way, many solutions have been proposed in the literature, which achieve confidentiality and integrity checking (some of them also provide authentication), however these methods usually represent a relatively high computational cost. This paper presents a new encryption mode for block cipher algorithms, which is based on the Plaintext Cipher Block Chaining (from now on, PCBC) mode. Our new mode supplies, apart from confidentiality, fast integrity checking with a minimum computational cost. This makes it eminently suitable for ensuring data integrity in GIS systems and at the same time assuring some other GIS requirements.