687 results

• • Seminar

  • Cryptography

  Middle-Product Learning With Errors

  • October 13, 2017

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

  Speaker : Miruna Rosca - ENS de Lyon

  We introduce a new variant MP-LWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials modulo an integer q. We exhibit a reduction from the Polynomial-LWE problem (PLWE) parametrized by a polynomial f, to MP-LWE which is defined independently of any such f. The reduction only requires f to be monic with constant coefficient coprime with q. It incurs a noise[…]

• • Seminar

  • Cryptography

  Low-Complexity Cryptographic Hash Functions

  • January 13, 2017

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

  Speaker : Vinod Vaikuntanathan - Massachusetts Institute of Technology

  Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.<br/> Despite[…]

• • Seminar

  • Cryptography

  Towards the Implementation of Efficient and Distributable Pairing-based Crypto Library

  • December 01, 2017

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

  Speaker : Al-Amin Khandaker - Okayama University

  Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of[…]

• • Seminar

  • Cryptography

  Coercion-resistant Internet voting made practical

  • March 03, 2017

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

  Speaker : Jacques Traore - Orange Labs

  Internet voting offers a better voting experience since voters can cast their votes from their computers or even smartphones. By eliminating the need to visit polling places, it may attract more voters and thus increase voter turnout. However, it is still not widely spread owing to many inherent concerns such as risks entailed by the lack of private polling booths. Indeed, this may ease coercion[…]

• • Seminar

  • Cryptography

  Où en est-on avec le calcul quantique?

  • May 19, 2017

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

  Speaker : Dimitri Petritis - IRMAR

  Le calculateur universel quantique n'a toujours pas dépassé le stade de prototype de démonstration et reste insuffisant pour faire tourner l'algorithme de factorisation de Shor sur des instances réalistes. Cependant, des avancées algorithmiques ont été faites sur des machines quantiques dédiées qui permettent d'aborder certains problèmes difficiles (au sens de la complexité); ces nouvelles[…]

• • Seminar

  • Cryptography

  Attaques par invariants : comment choisir les constantes de tour pour s'en protéger

  • January 19, 2018

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

  Speaker : Anne Canteaut - Inria

  Many lightweight block ciphers apply a very simple key schedule in which the round keys only differ by addition of a round-specific constant. Generally, there is not much theory on how to choose appropriate constants. In fact, several of those schemes were recently broken using invariant attacks, i.e. invariant subspace or nonlinear invariant attacks. This work analyzes the resistance of such[…]