Skip to main content

Advertisement

Springer Nature Link
Log in

A new class of security oriented error correcting robust codes

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

Robust codes are codes that can detect any nonzero errore with probability 1 − Q(e) > 0. This property makes them useful in protecting hardware systems from fault injection attacks which cause an arbitrary number of bit flips. This paper presents a new construction of non-linear robust q-ary codes with q = 2m and an error correction capability. The codes are built upon systematic linear codes [n, k, d]q whereas the n − k redundant symbols that were originally allocated to increase the minimum distance of the code are modified to provide both correction capability and robustness. The error masking probability of the codes is Q(e) upper bounded by 2/q for odd values of m and by 4/q for even m. Hence, they are more effective in detecting maliciously injected errors and have a higher code rate than codes obtained by concatenation of a linear error correcting code with a security oriented code.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. There are different ways to model an erroneous output. For example, in [12] faults in arithmetic circuits such as adders and multipliers are said to cause arithmetic errors. In this paper, we are primarily concerned with the number of bit flips and their locations; hence, we model the error as an additive error \(\mathbf {e} \in {\mathbb {F}_{q}^{n}}\).

  2. The operators ⊕ and ⊖ are equivalent because q = 2m; however, for the sake of clarity, we use both

References

  1. 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. https://doi.org/10.1109/EEEI.2012.6376995 (2012)

  2. Berger, T.P., Canteaut, A., Charpin, P., Laigle-Chapuy, Y.: On almost perfect nonlinear functions over \( \mathbb {F}_{2}^{n}\). IEEE Trans Inf Theory 52(9), 4160–4170 (2006)

    Article  MATH  Google Scholar 

  3. Biham, E., Shamir, A.: Differential Fault Analysis of Secret Key Cryptosystems. In: Advances in Cryptology—CRYPTO’97. Springer, pp. 513–525 (1997)

  4. Budaghyan, L., Carlet, C., Pott, A.: New classes of almost bent and almost perfect nonlinear polynomials. IEEE Trans Inf Theory 52(3), 1141–1152 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Carlet, C., Ding, C.: Highly nonlinear mappings. J Complex 20(2-3), 205–244 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. In: Advances in Cryptology–EUROCRYPT 2008. Springer, pp. 471–488 (2008)

  7. Dobbertin, H.: Almost perfect nonlinear power functions on G F(2n): the niho case. Inf Comput 151(1-2), 57–72 (1999)

    Article  MATH  Google Scholar 

  8. Dobbertin, H.: Almost Perfect Nonlinear Power Functions on G F(2n): a New Case for N Divisible by 5. In: Finite Fields and Applications. Springer, pp. 113–121 (2001)

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

  10. 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 

  11. Etzion, T., Vardy, A.: Perfect binary codes: constructions, properties, and enumeration. IEEE Trans Inf Theory 40(3), 754–763 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gaubatz, G., Sunar, B., Karpovsky, M.: Non-Linear Residue Codes for Robust Public-Key Arithmetic. In: Fault Diagnosis and Tolerance in Cryptography. Springer, pp 173–184 (2006)

  13. Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions (corresp.) IEEE Trans Inf Theory 14(1), 154–156 (1968)

    Article  MATH  Google Scholar 

  14. Karpovsky, M., Taubin, A.: New class of nonlinear systematic error detecting codes. IEEE Trans Inf Theory 50(8), 1818–1819 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Karpovsky, M., Kulikowski, K., Wang, Z.: Robust Error Detection in Communication and Computational Channels. In: SMMSP’2007. 2007 International Workshop On Spectral Methods and Multirate Signal Processing. Citeseer (2007)

  16. Kasami, T.: The weight enumerators for several classes of subcodes of the 2nd order binary reed-muller codes. Inf Control 18(4), 369–394 (1971)

    Article  MATH  Google Scholar 

  17. 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 

  18. Keren, O., Levin, I., Stankovic, R.S.: A technique for linearization of logic functions defined by disjoint cubes. i. – theoretical aspects. Autom Remote Control 72 (3), 615–625 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kulikowski, K., Wang, Z., Karpovsky, M.: Comparative Analysis of Fault Attack Resistant Architectures for Private and Public Key Cryptosystems. In: Proceedings of International Workshop Fault-Tolerant Cryptographic Devices, pp. 41–50 (2008)

  20. Kulikowski, K., Karpovsky, M., Taubin, A.: Fault Attack Resistant Cryptographic Hardware with Uniform Error Detection. In: Fault Diagnosis and Tolerance in Cryptography. Springer, pp 185–195 (2006)

  21. Kyureghyan, G.M., Suder, V.: On inverses of APN exponents. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT). IEEE, pp 1207–1211 (2012)

  22. Neumeier, Y., Keren, O.: A New Efficiency Criterion for Security Oriented Error Correcting Codes. In: 2014 19Th IEEE European Test Symposium (ETS). IEEE, pp 1–6 (2014)

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

    Article  MathSciNet  MATH  Google Scholar 

  24. 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, pp 82–87 (2015)

  25. Nyberg, K.: Differentially Uniform Mappings for Cryptography. In: Workshop on the Theory and Application of Of Cryptographic Techniques. Springer, pp 55–64 (1993)

  26. Phelps, K.: A combinatorial construction of perfect codes. SIAM J Algebraic Discret Methods 4(3), 398–403 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  27. Phelps, K.T., Levan, M.: Kernels of nonlinear Hamming codes. Des Codes Crypt 6(3), 247–257 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  28. Rabii, H., Keren, O.: A New Construction of Minimum Distance Robust Codes. In: International Castle Meeting on Coding Theory and Applications. Springer, pp 272–282 (2017)

  29. Rabii, H., Neumeier, Y., Keren, O.: Low Complexity High Rate Robust Codes. In: Steinbach, B (ed.) Further Improvements in the Boolean Domain, pp. 303–313. Cambridge Scholars Publishing (CSP) (2017)

  30. Rabii, H., Neumeier, Y., Keren, O.: High rate robust codes with low implementation complexity. IEEE Transactions on Dependable and Secure Computing, https://doi.org/10.1109/TDSC.2018.2816638 (2018)

  31. 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). IEEE, pp. 40–45 (2014)

  32. Vasil’ev, Y.L.: On nongroup close-packed codes. Probl Kibernet 8, 375–378 (1962)

    Google Scholar 

  33. Verbauwhede, IM (ed.): Secure integrated circuits and systems. Springer, Berlin (2010)

    MATH  Google Scholar 

  34. Wang, Z., Karpovsky, M.: Algebraic Manipulation Detection Codes and Their Applications for Design of Secure Cryptographic Devices. In: On-Line Testing Symposium (IOLTS), 2011 IEEE 17Th International. IEEE, pp. 234–239 (2011)

  35. Wang, Z., Karpovsky, M., Joshi, A.: Reliable MLC NAND Flash Memories Based on Nonlinear T-Error-Correcting Codes. In: 2010 IEEE/IFIP International Conference On Dependable Systems and Networks (DSN). IEEE, pp. 41–50 (2010)

  36. Wang, Z., Karpovsky, M., Kulikowski, K.: 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 

  37. Wang, Z., Karpovsky, M., Sunar, B.: Multilinear Codes for Robust Error Detection. In: 2009. IOLTS 2009. 15Th IEEE International On-Line Testing Symposium. IEEE, pp 164–169 (2009)

  38. Wang, Z., Karpovsky, M., Kulikowski, K.: Replacing Linear Hamming Codes by Robust Nonlinear Codes Results in a Reliability Improvement of Memories. In: 2009. DSN’09. IEEE/IFIP International Conference On Dependable Systems & Networks. IEEE, pp. 514–523 (2009)

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 Hila Rabii.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article is part of the Topical Collection on Special Issue on Coding Theory and Applications

This research was supported by the ISRAEL SCIENCE FOUNDATION (grant No. 923/16). A preliminary version of part of this work was presented at the 5th International Castle Meeting on Coding Theory and Applications (5ICMCTA), August 2017 [28].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rabii, H., Keren, O. A new class of security oriented error correcting robust codes. Cryptogr. Commun. 11, 965–978 (2019). https://doi.org/10.1007/s12095-018-0340-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-018-0340-3

Keywords

Search

Navigation