High Rate Robust Codes with Low Implementation Complexity

Hila Rabii; Yaara Neumeier; Osnat Keren

doi:https://doi.org/10.1109/tdsc.2018.2816638

High Rate Robust Codes with Low Implementation Complexity

Hila Rabii, Yaara Neumeier, Osnat Keren

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Abstract

Robust codes {\mathcal {C}}(n,k)-qC(n,k)q are nonlinear qq-ary codes of dimension kk and length n\leq 2kn≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between nn and kk, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any kk and nn. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.

Original language	English
Article number	8318671
Pages (from-to)	511-520
Number of pages	10
Journal	IEEE Transactions on Dependable and Secure Computing
Volume	16
Issue number	3
DOIs	https://doi.org/10.1109/tdsc.2018.2816638
State	Published - 1 May 2019

Keywords

High rate robust codes
fault injection
hardware security
lightweight secure architecture
security oriented codes

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

https://doi.org/10.1109/tdsc.2018.2816638

Cite this

@article{4c095e6f4c944ec39fa18be3bfc80859,

title = "High Rate Robust Codes with Low Implementation Complexity",

abstract = "Robust codes {\mathcal {C}}(n,k)-qC(n,k)q are nonlinear qq-ary codes of dimension kk and length n\leq 2kn≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between nn and kk, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any kk and nn. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.",

keywords = "High rate robust codes, fault injection, hardware security, lightweight secure architecture, security oriented codes",

author = "Hila Rabii and Yaara Neumeier and Osnat Keren",

note = "Publisher Copyright: {\textcopyright} 2004-2012 IEEE.",

year = "2019",

month = may,

day = "1",

doi = "https://doi.org/10.1109/tdsc.2018.2816638",

language = "الإنجليزيّة",

volume = "16",

pages = "511--520",

journal = "IEEE Transactions on Dependable and Secure Computing",

issn = "1545-5971",

number = "3",

}

TY - JOUR

T1 - High Rate Robust Codes with Low Implementation Complexity

AU - Rabii, Hila

AU - Neumeier, Yaara

AU - Keren, Osnat

PY - 2019/5/1

Y1 - 2019/5/1

N2 - Robust codes {\mathcal {C}}(n,k)-qC(n,k)q are nonlinear qq-ary codes of dimension kk and length n\leq 2kn≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between nn and kk, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any kk and nn. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.

AB - Robust codes {\mathcal {C}}(n,k)-qC(n,k)q are nonlinear qq-ary codes of dimension kk and length n\leq 2kn≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between nn and kk, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any kk and nn. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.

KW - High rate robust codes

KW - fault injection

KW - hardware security

KW - lightweight secure architecture

KW - security oriented codes

UR - http://www.scopus.com/inward/record.url?scp=85044048145&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/tdsc.2018.2816638

DO - https://doi.org/10.1109/tdsc.2018.2816638

M3 - مقالة

SN - 1545-5971

VL - 16

SP - 511

EP - 520

JO - IEEE Transactions on Dependable and Secure Computing

JF - IEEE Transactions on Dependable and Secure Computing

IS - 3

M1 - 8318671

ER -

High Rate Robust Codes with Low Implementation Complexity

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this