599 results

  • Challenges related to random number generation for cryptographic applications

    • June 07, 2019

    • Laboratoire Hubert Curien - Salles Petri/Turing

    Speaker : Elie Noumon Allini

    The main purpose of cryptography is to ensure secure communication. In order to achieve this goal, cryptographic schemes make an intensive use of random numbers. Given that the security of these schemes highly depends on these numbers, it is important to produce high-quality random numbers. Knowing that most cryptographic modules are nowadays implemented in logic devices, we investigated True[…]
  • Improved Veron Identification and Signature Schemes in the Rank Metric

    • June 07, 2019

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

    Speaker : Florian Caullery - Darkmatter

    Abstract—It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform.<br/> All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2[…]
  • A Formal Analysis of 5G Authentication

    • June 03, 2019

    • Inria Center of the University of Rennes - -Petri/Turing room

    Speaker : Sasa Radomirovic (University of Dundee)

    Mobile communication networks connect much of the world’s population. The security of users’ calls, text messages, and mobile data depends on the guarantees provided by the Authenticated Key Exchange protocols used. For the next-generation network (5G), the 3GPP group has standardized the 5G AKA protocol for this purpose.In this talk, I will report on our formalization of the 5G standard’s AKA[…]
  • Approx-SVP in Ideal Lattices with Pre-processing

    • May 24, 2019

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

    Speaker : Alice Pellet-Mary - ENS de Lyon

    Finding a short non zero vector in an Euclidean lattice is a well-studied problem which has proven useful to construct many cryptographic primitives. The current best asymptotic algorithm to find a relatively short vector in an arbitrary lattice is the BKZ algorithm. This algorithm recovers a vector which is at most $2^{n^{\alpha}}$ times larger than the shortest non zero vector in time $2^{n^{1-[…]
  • Automated software protection for the masses against side-channel attacks

    • May 10, 2019

    • Univ Grenoble Alpes, CEA, List - Salles Petri/Turing

    Speaker : Nicolas Belleville

    This presentation will present an approach and a tool that answer the need for effective, generic, and easily applicable protections against side-channel attacks. The protection mechanism is based on code polymorphism, so that the observable behaviour of the protected component is variable and unpredictable to the attacker. Our approach combines lightweight specialized runtime code generation with[…]
  • Do Not Trust Modern System-on-Chips - Electromagnetic fault injection against a System-on-Chip

    • May 10, 2019

    • INRIA - Salles Petri/Turing

    Speaker : Ronan Lashermes

    Electromagnetic fault injection (EMFI) is a well known technique to disturb the behavior of a chip and weaken its security. These attacks are still mostly done on simple microcontrollers since the fault effects is relatively simple and understood.Unlocking EMFI on modern System-on-Chips (SoCs), the fast and complex chips ubiquitous today, requires to understand the impact of the faults. In this[…]