Skip to main content
European Commission logo print header

Co-Orthogonal Codes in Cryptography, Data Security, Watermarking and in Entity Authentication

Objectif

Co-orthogonal codes are a newly discovered class of codes with attractive properties and possible applications in Cryptography and Data Security. The present project unifies the efforts of experts on a wide spectrum of fields of science (theoretical mathematics (combinatorics), theoretical computer science, applied cryptography, data security and smart-card technologies) to examine the potential applications of the newly discovered co-orthogonal codes. Since Hungary is a newly associated state, this programme may help to turn Hungary's strong research potential in Theory (Combinatorics, theoretical mathematics) into applicable research. Co-orthogonal codes are a newly discovered class of codes with attractive properties and possible applications in Cryptography and Data Security. The present project unifies the efforts of experts on a wide spectrum of fields of science (theoretical mathematics (combinatorics), theoretical computer science, applied cryptography, data security and smart-card technologies) to examine the potential applications of the newly discovered co-orthogonal codes. Since Hungary is a newly associated state, this programme may help to turn Hungary's strong research potential in Theory (Combinatorics, theoretical mathematics) into applicable research.

OBJECTIVES
Our objectives are to examine the applicability of co-orthogonal codes in cryptographic and data security applications (including smart-card technologies, watermarking, entity authentication). Co-orthogonal codes are very new mathematical phenomenon, discovered by one of the partners in the project. Their relatively high rate falsified long standing (20 years old) mathematical conjectures, causing surprise in combinatorics. The goal of the present project is gathering experts from very different backgrounds to facilitate a possible conversion of this discovery in theoretical mathematics into an industrial product. Our further goal is to facilitate the strong researchers at the Eotvos University.

DESCRIPTION OF WORK
This is a short assessment project for establishing the possible applications of co-orthogonal codes in Cryptography, Data Security (including smart card technologies, watermarking, telecommunication security). The main, long-term goal is to build algorithms, using the advantages and surprising properties of co-orthogonal codes, in Cryptography and Data Security. This goal involves two sort of expertise: the deep understanding of co-orthogonal codes and the deep understanding of vital features of cryptographic/data security algorithms. The partners complement each other in this sense, making possible a successful joint work in the field.
Co-orthogonal codes have the following advantages:
A) the validity of a key can be proved using very small memory;
B) the validation process can be distributed between different entities, simply by cutting the code to smaller parts, the entities will not know whether their part is valid or not. The validity of the key will follow only after combining the results from the entities (may aim global computing/distributive computing applications);
C) The rate of the code is much larger than the rate of orthogonal codes;
D) The codes can be used for group authentication, also aiming global computing/distributive computing applications. Consequently, the short-term goal (within the framework of this short assessment project) is turning these possibilities into actual (proto-) algorithms, and comparing these algorithms to the existing ones.

Appel à propositions

Data not available

Coordinateur

UNIVERSITAT ROVIRA I VIRGILI
Contribution de l’UE
Aucune donnée
Adresse
C/ DE ESCORXADOR S/N
43003 TARRAGONA
Espagne

Voir sur la carte

Coût total
Aucune donnée

Participants (1)