Description
The need of high data rates on the radio channel (WiFi and its future for example) explains the increasing number of researchers working on space-time codes. Preparing Wireless IP systems, some companies and some researchers are promoting the use of non coherent space-time codes.<br/> We show that designing a non coherent space-time code is equivalent to finding some good packings on the Grassmann manifold. But the minimum distance of the packing is not a Euclidean distance and the codes need to be decoded with a "not too complex" algorithm. To solve this problem, we propose a new family of codes on the Grassmann manifold as well as the associated performances.
Prochains exposés
-
Séminaire C2 à INRIA Paris
Emmanuel Thomé et Pierrick Gaudry Rachelle Heim Boissier Épiphane Nouetowa Dung Bui Plus d'infos sur https://seminaire-c2.inria.fr/ -
Attacking the Supersingular Isogeny Problem: From the Delfs–Galbraith algorithm to oriented graphs
Orateur : Arthur Herlédan Le Merdy - COSIC, KU Leuven
The threat of quantum computers motivates the introduction of new hard problems for cryptography.One promising candidate is the Isogeny problem: given two elliptic curves, compute a “nice’’ map between them, called an isogeny.In this talk, we study classical attacks on this problem, specialised to supersingular elliptic curves, on which the security of current isogeny-based cryptography relies. In[…]-
Cryptography
-