Table of contents

  • This session has been presented November 26, 2021.

Description

  • Speaker

    André Schrottenloher - CWI

The security of modern cryptosystems relies on computational assumptions, which may be challenged by the advent of large-scale quantum computing devices.<br/> While Shor's algorithm is known to break today's most popular public-key schemes, secret-key cryptosystems are generally expected to retain half of their pre-quantum bits of security. However, the precise advantage of quantum attacks cannot be determined without a dedicated analysis.<br/> In this talk, we will focus on key-recovery attacks against block ciphers. These attacks are often categorized in two scenarios, depending on the type of black-box access allowed to the adversary: either a classical query access, or a "quantum" query access where the black-box is part of the adversary's quantum algorithm. Attacks with classical queries, which are deemed more realistic, have so far complied with the rule of halving security levels.<br/> On the contrary, attacks with quantum queries can break some classically secure designs which exhibit a strong algebraic structure (Kuwakado & Morii, ISIT 2010).<br/> Exploiting this structure with classical queries only was the goal of the offline-Simon algorithm of Bonnetain et al. (ASIACRYPT 2019). In the final part of this talk, we will show that this algorithm allows to reach a more than quadratic speedup against some specific block cipher constructions. This is joint work with Xavier Bonnetain and Ferdinand Sibleyras.<br/> lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09

Next sessions

  • Séminaire C2 à INRIA Paris

    • January 16, 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

    • January 23, 2026 (13:45 - 14:45)

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

    Speaker : 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

Show previous sessions
Page top