Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

701 résultats

    • Séminaire

    • Cryptographie

    Cryptanalysis of Round-Reduced PRINCE and TWINE

    • 27 mars 2015

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

    Orateur : Patrick Derbez - Luxembourg

    NXP Semiconductors and its academic partners challenged the cryptographic community with finding practical attacks on the block cipher they designed, PRINCE. In the first part of this talk we present new attacks on round-reduced PRINCE including the ones which won the challenge in the 6 and 8-round categories --- the highest for which winners were identified. Our first attacks rely on a meet-in[…]

    • Séminaire

    • Cryptographie

    Same-Values Analysis on Elliptic Curve Cryptography

    • 25 avril 2014

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

    Orateur : Cédric Murdica - Secure-IC

    Elliptic Curve Cryptography (ECC) is believed to be unbreakable in the black box model, where the cryptanalyst has access to inputs and outputs only. However, it is not enough if the cryptosystem is embedded on a device that is physically accessible to potential attackers. In addition to inputs and outputs, the attacker can study the physical behaviour of the device such as the execution time or[…]

    • Séminaire

    • Cryptographie

    Cyclic and quasi-cyclic separable Goppa codes

    • 14 novembre 2014

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

    Orateur : Sergey Bezzateev - Université d'État de Saint-Pétersbourg

    Overview of recent results in constructions of cyclic and quasi-cyclic Goppa codes. Classical and generalized Goppa codes are considered. Subclasses of embedded optimal quasi-cyclic Goppa codes with improvement parameters are presented.

    • Séminaire

    • Cryptographie

    On Error Correction for Physical Unclonable Functions

    • 12 décembre 2014

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

    Orateur : Sven Muelich - Institute of Communications Engineering, Ulm University

    Cryptographic applications require random, unique and unpredictable keys. Since most cryptosystems need to access the key several times, it usually has to be stored permanently. This is a potential vulnerability regarding security, even if a protected memory is used as key storage. Implementing secure key generation and storage is therefore an important and challenging task which can be[…]

    • Séminaire

    • Cryptographie

    Learning with Errors in the Exponent

    • 07 mars 2014

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

    Orateur : özgür Dagdelen - Darmstadt University

    We initiate the study of a novel class of group-theoretic intractability problems. Inspired by the theory of learning in presence of errors [Regev, STOC'05] we ask if noise in the exponent amplifies intractability. We put forth the notion of Learning with Errors in the Exponent (LWEE) and rather surprisingly show that various attractive properties known to ex- clusively hold for lattices carry[…]

    • Séminaire

    • Cryptographie

    Une solution du problème "Isomorphisme de polynômes à deux

    • 26 septembre 2014

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

    Orateur : Jérôme Plût - ANSSI

    Le problème d'isomorphisme de polynômes à deux secrets (IP2S) pour m=2 variables sur un corps k est le suivant: étant données deux familles a, b de deux polynômes quadratiques chacune, trouver deux applications linéaires bijectives s, t telles que b = t ° a ° s. Nous donnons un algorithme permettant de calculer s, t en un temps O(n^4) pour toutes les instances.<br/> Le problème IP2S a été[…]
Haut de page