Skip to main content
SpringerLink
Log in

A novel maximum distance separable code to generate universal identifiers

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

Nowadays it is vital to have a robust mechanism that can identify people, objects, animals, and living beings, for example, for agricultural, health and national security purposes. Some drawbacks occur when very many objects need to be identified, and the tool is unable to support all of them. Even if the mechanism could tag them all, it is also important that the labels or codewords not resemble each other, to be able to detect and correct errors. To solve this problem, this article proposes an MDS (Maximum Distance Separable) code C with length 11 and dimension 7 over the finite field \({\mathbb {F}}_{2^{10}}\). Furthermore, we construct a subcode of C with capacity for 327 different identifiers. Concretely we consider the set of all codewords with entries belonging to the subfield of \({\mathbb {F}}_{2^{10}}\) isomorphic to \({\mathbb {F}}_{2^{5}}\). A decoding algorithm and an encryption method using elliptic curves cryptography for the codewords are also proposed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alhaqbani, B., Fidge, C.J.: Privacy-preserving electronic health record linkage using pseudonym identifiers. In: 10th IEEE international conference on e-health networking, applications and services. HealthCom, Singapore, Singapore, pp 108–117 (2008)

  2. Baker, D.: The joint commission’s 2017 national patient safety goals, Available from: https://www.jointcommission.org/npsg_presentation/, (accessed 17 July 2017) (2017)

  3. Bernstein, D., Lange, T.: Safecurves, Available from: http://safecurves.cr.yp.to, (accessed 17 July 2017) (2014)

  4. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235–265 (1997). Computational algebra and number theory (London, 1993). MR MR1484478

    Article  MathSciNet  MATH  Google Scholar 

  5. Dewaghe, L.: Remarks on the schoof-elkies-atkin algorithm. Math. Comput. American Math. Soc. 67(223), 1247–1252 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Faldum, A., Pommerening, K.: An optimal code for patient identifiers. Comput. Meth. Programs Biomed. 79, 81–88 (2005)

    Article  Google Scholar 

  7. IEEE P1363 Working Group: Standard specifications for public-key cryptography, Available from: http://grouper.ieee.org/groups/1363/, (accessed 17 July 2017) (2001)

  8. Gutierrez, I., Willems, W.: Una introducción a la criptografía de clave pública, 2 edn. Ediciones Uninorte (2008)

  9. Huffman, W.C., Pless, V.: Fundamentals of error-correcting codes. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  10. Kraft, J.S., Washington, L.C.: An introduction to number theory with cryptography. CRC Press, Boca Raton (2013)

    MATH  Google Scholar 

  11. Lee, Y.J., Lee, K.H.: Re-identification of medical records by optimum quasi-identifiers. In: 19th International Conference on Advanced Communication Technology (ICACT), Bongpyeong, South Korea, pp 428–435 (2017)

  12. Lochter, M., Merkle, J.: Ecc brainpool standard curves and curve generation, Available from: http://www.ecc-brainpool.org/download/Domain-parameters.pdf, (accessed 17 July 2017) (2010)

  13. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. 1st edn. North-Holland Mathematical Library, Amsterdam (1998)

  14. Molina, I.: A maximum distance separable code to generate universal identifiers, Tesis De Maestría, Universidad Del Norte, Barranquilla, Colombia (2016)

  15. World Health Organization, Patient identification: Patient safety solutions, Available from: http://www.who.int/patientsafety/solutions/patientsafety/PS-Solution2.pdf, (accessed 17 July 2017) (2007)

  16. Ryabko, B., Fionov, A.: Basics of contemporary cryptography for IT practitioners, vol. 1 World Scientific (2005)

  17. Siemens: European green city index, Available from: https://www.siemens.com/entry/cc/features/greencityindex_international/all/en/pdf/report_en.pdf, (accessed 17 July 2017) (2009)

  18. Stein, W.: Sagemath, Available from: http://www.sagemath.org/index.html, (accessed 17 July 2017) (2005)

  19. Taneja, H., Singh, A.K.: Preserving privacy of patients based on reidentification risk. Procedia Comput. Sci. 70, 448–454 (2015)

    Article  Google Scholar 

  20. Thomas, P., Evans, C.: An identity crisis? aspects of patient misidentification. Clinical Risk 10(1), 18–22 (2004)

    Article  Google Scholar 

  21. Trappe, W., Washington, L., Anshel, M., Boklan, K.D.: Introduction to cryptography with coding theory. Math. Intell. 29(3), 66–69 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Universidad del Norte, Km 5 via a Puerto Colombia, Barranquilla, Colombia

    Ismael Gutiérrez García

  2. Department of Computer Science, Universidad del Norte, Km 5 via a Puerto Colombia, Barranquilla, Colombia

    Daladier Jabba Molinares & Ivan Molina Naizir

Authors
  1. Ismael Gutiérrez García
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daladier Jabba Molinares
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Molina Naizir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ismael Gutiérrez García.

Additional information

Publisher’s note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

García, I.G., Molinares, D.J. & Naizir, I.M. A novel maximum distance separable code to generate universal identifiers. Cryptogr. Commun. 11, 1021–1035 (2019). https://doi.org/10.1007/s12095-018-0346-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-018-0346-x

Keywords

Mathematics Subject Classification (2010)

Search

Navigation