A new construction of minimum distance robust codes

Hila Rabii; Osnat Keren

doi:10.1007/978-3-319-66278-7_23

A new construction of minimum distance robust codes

Hila Rabii, Osnat Keren

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

Robust codes are codes that can detect any nonzero error with nonzero probability. This property makes them useful in protecting hardware systems from fault injection attacks which cause arbitrary number of bit flips. There are very few high rate robust codes, non of them has minimum distance greater than two. Therefore, robust codes with error correction capability are derived by concatenation of linear codes with high rate robust codes. This paper presents a new construction of non-linear robust codes with error correction capability. The codes are built upon linear codes; however, the redundant symbols that were originally allocated to increase the minimum distance of the code, are modified to provide both correction capability and robustness. Consequently, the codes are more effective and have higher rate than concatenated codes of the same error masking probability.

Original language	English
Title of host publication	Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings
Editors	Angela I. Barbero, Vitaly Skachek, Oyvind Beck
Publisher	Springer Verlag
Pages	272-282
Number of pages	11
ISBN (Print)	9783319662770
DOIs	https://doi.org/10.1007/978-3-319-66278-7_23
State	Published - 2017
Event	5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 - Vihula, Estonia Duration: 28 Aug 2017 → 31 Aug 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10495 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017
Country/Territory	Estonia
City	Vihula
Period	28/08/17 → 31/08/17

Bibliographical note

Publisher Copyright:
© 2017, Springer International Publishing AG.

Keywords

Error correction
Fault injection attacks
Nonlinear
Robust
Security oriented codes

Access to Document

10.1007/978-3-319-66278-7_23

Cite this

Rabii, H., & Keren, O. (2017). A new construction of minimum distance robust codes. In A. I. Barbero, V. Skachek, & O. Beck (Eds.), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings (pp. 272-282). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-66278-7_23

Rabii, Hila ; Keren, Osnat. / A new construction of minimum distance robust codes. Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. editor / Angela I. Barbero ; Vitaly Skachek ; Oyvind Beck. Springer Verlag, 2017. pp. 272-282 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0a3dbbc775594d8da03d7537a031884a,

title = "A new construction of minimum distance robust codes",

abstract = "Robust codes are codes that can detect any nonzero error with nonzero probability. This property makes them useful in protecting hardware systems from fault injection attacks which cause arbitrary number of bit flips. There are very few high rate robust codes, non of them has minimum distance greater than two. Therefore, robust codes with error correction capability are derived by concatenation of linear codes with high rate robust codes. This paper presents a new construction of non-linear robust codes with error correction capability. The codes are built upon linear codes; however, the redundant symbols that were originally allocated to increase the minimum distance of the code, are modified to provide both correction capability and robustness. Consequently, the codes are more effective and have higher rate than concatenated codes of the same error masking probability.",

keywords = "Error correction, Fault injection attacks, Nonlinear, Robust, Security oriented codes",

author = "Hila Rabii and Osnat Keren",

note = "Publisher Copyright: {\textcopyright} 2017, Springer International Publishing AG.; 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 ; Conference date: 28-08-2017 Through 31-08-2017",

year = "2017",

doi = "10.1007/978-3-319-66278-7_23",

language = "אנגלית",

isbn = "9783319662770",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "272--282",

editor = "Barbero, {Angela I.} and Vitaly Skachek and Oyvind Beck",

booktitle = "Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings",

address = "גרמניה",

}

Rabii, H & Keren, O 2017, A new construction of minimum distance robust codes. in AI Barbero, V Skachek & O Beck (eds), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10495 LNCS, Springer Verlag, pp. 272-282, 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, Vihula, Estonia, 28/08/17. https://doi.org/10.1007/978-3-319-66278-7_23

A new construction of minimum distance robust codes. / Rabii, Hila; Keren, Osnat.
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. ed. / Angela I. Barbero; Vitaly Skachek; Oyvind Beck. Springer Verlag, 2017. p. 272-282 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A new construction of minimum distance robust codes

AU - Rabii, Hila

AU - Keren, Osnat

PY - 2017

Y1 - 2017

N2 - Robust codes are codes that can detect any nonzero error with nonzero probability. This property makes them useful in protecting hardware systems from fault injection attacks which cause arbitrary number of bit flips. There are very few high rate robust codes, non of them has minimum distance greater than two. Therefore, robust codes with error correction capability are derived by concatenation of linear codes with high rate robust codes. This paper presents a new construction of non-linear robust codes with error correction capability. The codes are built upon linear codes; however, the redundant symbols that were originally allocated to increase the minimum distance of the code, are modified to provide both correction capability and robustness. Consequently, the codes are more effective and have higher rate than concatenated codes of the same error masking probability.

AB - Robust codes are codes that can detect any nonzero error with nonzero probability. This property makes them useful in protecting hardware systems from fault injection attacks which cause arbitrary number of bit flips. There are very few high rate robust codes, non of them has minimum distance greater than two. Therefore, robust codes with error correction capability are derived by concatenation of linear codes with high rate robust codes. This paper presents a new construction of non-linear robust codes with error correction capability. The codes are built upon linear codes; however, the redundant symbols that were originally allocated to increase the minimum distance of the code, are modified to provide both correction capability and robustness. Consequently, the codes are more effective and have higher rate than concatenated codes of the same error masking probability.

KW - Error correction

KW - Fault injection attacks

KW - Nonlinear

KW - Robust

KW - Security oriented codes

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

U2 - 10.1007/978-3-319-66278-7_23

DO - 10.1007/978-3-319-66278-7_23

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85028537333

SN - 9783319662770

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 272

EP - 282

BT - Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings

A2 - Barbero, Angela I.

A2 - Skachek, Vitaly

A2 - Beck, Oyvind

PB - Springer Verlag

T2 - 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017

Y2 - 28 August 2017 through 31 August 2017

ER -

Rabii H, Keren O. A new construction of minimum distance robust codes. In Barbero AI, Skachek V, Beck O, editors, Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Springer Verlag. 2017. p. 272-282. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-66278-7_23

A new construction of minimum distance robust codes

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this