On Codes for Detecting Address and Data Manipulations in Memory Arrays

Gilad Dar, Shlomo Engelberg, Osnat Keren

Research output: Contribution to journalArticlepeer-review

Abstract

Often, data stored in memory must be protected from naturally occurring and malicious errors. Methods for constructing codes that are robust with respect to errors injected into the data as well as into the address (in which the data are to be stored) are described. Several ways of extending data-protecting codes to address-and-data protecting codes are presented, and a generalization of the concepts behind CPCs – low cost codes for which no error injected into the data is ever completely masked – is given. A fundamental difference between attacks on the address and data and attacks that only target the data is detailed, and the consequences of this fundamental difference are briefly considered.

Original languageEnglish
Pages (from-to)1
Number of pages1
JournalIEEE Transactions on Information Theory
DOIs
StateAccepted/In press - 2024

Bibliographical note

Publisher Copyright:
IEEE

Keywords

  • Codes
  • Error detecting codes
  • Fault injection attacks
  • Galois fields
  • Hardware security
  • Linear codes
  • Measurement
  • Robust codes
  • Robustness
  • Secure memory
  • Security
  • Vectors

Fingerprint

Dive into the research topics of 'On Codes for Detecting Address and Data Manipulations in Memory Arrays'. Together they form a unique fingerprint.

Cite this