Anzeige
Erschienen in:
20.12.2018
A novel maximum distance separable code to generate universal identifiers
Erschienen in: Cryptography and Communications | Ausgabe 5/2019
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.