Sommaire

  • Cet exposé a été présenté le 19 octobre 2007.

Description

  • Orateur

    Suba Subbalakshmi - Stevens Institute of Technology

Achieving secure and reliable communication in a wireless network is especially challenging when the end devices are energy constrained. Traditionally, forward error correcting codes (FECs) and encryption have been used to correct errors and provide secrecy respectively, in a tandem system. This conventional approach could be potentially less efficient than a joint system (where both functionalities are combined into a single paradigm). The key question is: can the two operations be combined safely and if so what are the impacts of such a joint construction on both error correction capability as well as security?<br/> In this talk we will show that it is indeed possible to combine error correction and encryption in the specific case of block ciphers. The core of this construction is a new class of maximum distance separable (MDS) codes, which we call high diffusion (HD) codes, that incorporate both a criterion for optimal diffusion as well as a criterion for error correction. We will present the fundamental ideas behind HD codes and discuss the construction of the codes and block ciphers based on these codes. Security and error correction capabilities of the joint system will be discussed. Stream mode construction of the cipher will also be presented along with some simulation results.

Prochains exposés

  • Séminaire C2 à INRIA Paris

    • 16 janvier 2026 (10:00 - 17:00)

    • 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

    • 23 janvier 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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

Voir les exposés passés
Haut de page