Skip to main content
Springer Nature Link
Log in

A New Construction of Minimum Distance Robust Codes

  • Conference paper
  • First Online:
Coding Theory and Applications (ICMCTA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10495))

Included in the following conference series:

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.

This research was supported by the ISRAEL SCIENCE FOUNDATION (grant No. 923/16).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 513–525. Springer, Heidelberg (1997). doi:10.1007/BFb0052259

    Chapter  Google Scholar 

  2. Tomashevich, V., Neumeier, Y., Kumar, R., Keren, O., Polian, I.: Protecting cryptographic hardware against malicious attacks by nonlinear robust codes. In: 2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), pp. 40–45. IEEE (2014)

    Google Scholar 

  3. Verbauwhede, I.M. (ed.): Secure Integrated Circuits and Systems. Springer, New York (2010)

    MATH  Google Scholar 

  4. Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471–488. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78967-3_27

    Chapter  Google Scholar 

  5. Wang, Z., Karpovsky, M.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: 2011 IEEE 17th International on On-Line Testing Symposium (IOLTS), pp. 234–239. IEEE (2011)

    Google Scholar 

  6. Ngo, X.T., Bhasin, S., Danger, J., Guilley, S., Najm, Z.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan Horses. In: IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2015, Washington, DC, USA, 5–7 May 2015, pp. 82–87 (2015)

    Google Scholar 

  7. Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. Cryptology ePrint Archive, Report 2009/608 (2009). http://eprint.iacr.org/2009/608

  8. Keren, O., Karpovsky, M.: Relations between the entropy of a source and the error masking probability for security-oriented codes. IEEE Trans. Commun. 63(1), 206–214 (2015)

    Google Scholar 

  9. Karpovsky, M.G., Kulikowski, K.J., Wang, Z.: Robust error detection in communication and computational channels. In: International Workshop on Spectral Methods and Multirate Signal Processing, SMMSP 2007, Citeseer (2007)

    Google Scholar 

  10. Admaty, N., Litsyn, S., Keren, O.: Puncturing, expurgating and expanding the q-ary BCH based robust codes. In: 2012 IEEE 27th Convention of Electrical Electronics Engineers in Israel (IEEEI), pp. 1–5, November 2012

    Google Scholar 

  11. Neumeier, Y., Keren, O.: Robust generalized punctured cubic codes. IEEE Trans. Inf. Theory 60(5), 2813–2822 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rabii, H., Neumeier, Y., Keren, O.: Low complexity high rate robust codes derived from the quadratic-sum code. In: 12th International Workshop on Boolean Problems (2016)

    Google Scholar 

  13. Engelberg, S., Keren, O.: A comment on the karpovsky-taubin code. IEEE Trans. Inf. Theory 57(12), 8007–8010 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Neumeier, Y., Keren, O.: A new efficiency criterion for security oriented error correcting codes. In: 2014 19th IEEE European Test Symposium (ETS), pp. 1–6. IEEE (2014)

    Google Scholar 

  15. Wang, Z., Karpovsky, M.G., Kulikowski, K.J.: Replacing linear hamming codes by robust nonlinear codes results in a reliability improvement of memories. In: IEEE/IFIP International Conference on Dependable Systems & Networks, DSN 2009, pp. 514–523. IEEE (2009)

    Google Scholar 

  16. Wang, Z., Karpovsky, M., Kulikowski, K.J.: Design of memories with concurrent error detection and correction by nonlinear SEC-DED codes. J. Electron. Test. 26(5), 559–580 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel

    Hila Rabii & Osnat Keren

Authors
  1. Hila Rabii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Osnat Keren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Osnat Keren .

Editor information

Editors and Affiliations

  1. University of Valladolid, Valladolid, Spain

    Ángela I. Barbero

  2. University of Tartu, Tartu, Estonia

    Vitaly Skachek

  3. Simula@UiB and University of Bergen, Bergen, Norway

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rabii, H., Keren, O. (2017). A New Construction of Minimum Distance Robust Codes. In: Barbero, Á., Skachek, V., Ytrehus, Ø. (eds) Coding Theory and Applications. ICMCTA 2017. Lecture Notes in Computer Science(), vol 10495. Springer, Cham. https://doi.org/10.1007/978-3-319-66278-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66278-7_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66277-0

  • Online ISBN: 978-3-319-66278-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation