522 results

  • co-organisée avec le séminaire sécurité des systèmes électroniques embarqués

    • April 23, 2021

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

    Speaker : mot de passe: 344005 - très classe le mot de passe en clair !

    https://seminaires-dga.inria.fr/securite-elec/<br/&gt; lien: https://bbb.irisa.fr/b/ger-mvp-9xd
  • Lattice-based NIST candidates: abstractions and ninja tricks

    • April 23, 2021

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

    Speaker : Thomas Prest - PQShield

    I will present the remaining lattice-based candidates for standardization by NIST (2 signature schemes, 5 encryption schemes). At a high level, these can all be interpreted as straightforward instantiations of decades-old paradigms. But when we look under the hood, all of them make design choices which impact their security, efficiency and portability in distinct manners; we will discuss these.[…]
  • Post-Quantum Cryptography Hardware: Monolithic Implementations vs. Hardware-Software Co-Design

    • April 23, 2021

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

    Speaker : Markku-Juhani Saarinen - PQShield

    At PQShield, we've developed dedicated coprocessor(s) for lattice schemes, hash-based signatures, and code-based cryptography. These cryptographic modules are commercial rather than academic and designed to meet customer specifications such as a specific performance profile or Common Criteria and FIPS security certification requirements. Hardware implementations of legacy RSA and Elliptic Curve[…]
  • Middle-Product Learning with Rounding Problem and its Applications

    • April 17, 2020

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

    Speaker : Katharina Boudgoust - Univ Rennes, CNRS, IRISA

    This talk focuses on a new variant of the Learning With Errors (LWE) problem, a fundamental computational problem used in lattice-based cryptography.<br/> At Crypto17, Roşca et al. introduced the Middle-Product LWE problem (MP-LWE), whose hardness is based on the hardness of the Polynomial LWE (P-LWE) problem parameterized by a large set of polynomials, making it more secure against the possible[…]
  • Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

    • April 10, 2020

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

    Speaker : Emmanuel Thomé - INRIA Nancy

    We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not[…]
  • The generalized quaternion isogeny path problem.

    • April 03, 2020

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

    Speaker : Antonin Leroux - LIX

    The correspondence between maximal orders in a quaternion algebra and supersingular elliptic curves has uncovered new perspectives in the field of isogeny-based cryptography. The KLPT algorithm of Kohel et al. in 2014 introduces an algorithm solving the quaternion isogeny path problem in polynomial time. Studying this problem has applications both constructive and destructive. It has allowed to[…]