Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

708 results

    • Seminar

    • Cryptography

    On Error Correction for Physical Unclonable Functions

    • December 12, 2014

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

    Speaker : 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[…]
    • Seminar

    • Cryptography

    Beyond the black and grey box

    • April 25, 2014

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

    Speaker : Yoni De Mulder - University of Leuven

    In the white-box attack context, i.e., the setting where an implementation of a cryptographic algorithm is executed on an untrusted open platform, the adversary has full access to the implementation and its execution environment. As a result, the adversary is much more powerful than in a traditional black-box environment in which the adversary has only access to the inputs and outputs of a[…]
    • Seminar

    • Cryptography

    A heuristic quasi-polynomial algorithm for discrete logarithm

    • October 03, 2014

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

    Speaker : Razvan Basbulescu - LORIA

    in finite fields of small characteristic The difficulty of discrete logarithm computations in fields GF(q^k) depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the complexity of factoring. If n is the bit-size of q^k, then L(1/3) can be approximated by 2^(n^(1/3)). In 2013, Joux designed a new algorithm for constant[…]
    • Seminar

    • Cryptography

    Broadcast encryption: combinatorial vs. algebraic methods

    • April 10, 2015

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

    Speaker : Duong-Hieu Phan - ENS

    We consider a generalisation of the encryption from "one-to-one'' to "one-to-many'' communication, i.e. broadcast encryption. The objective is to allow a center to send secret messages to a large number of receivers. The security notion in “one-to-many” communications needs to be extended beyond the notion of confidentiality in “one-to-one” encryption in order to meet practical requirements. Two[…]
    • Seminar

    • Cryptography

    Towards Automatic Verification of Security Proofs for

    • July 01, 2011

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

    Speaker : Marion Daubrignard - Verimag

    Providing security proofs instead of arguing lack of existing relevant attacks is a quite new approach when it comes to cryptography. In the last thirty years, a lot of work has been done to formalize security of systems and prove of the achievement of security criteria. It has resulted in the design of a great number of proofs under various hypotheses. Though a step in the right direction, these[…]
    • Seminar

    • Cryptography

    New LFSRs and FCSRs representations for stream ciphers hardware

    • April 19, 2013

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

    Speaker : Marine Minier - Université de Lyon

    In this talk, we will sum up our recent research results concerning the introduction of a new representation for FCSRs and for LFSRs. This matrix based representation allows to construct LFSRs and FCSRs with a more compact hardware representation and a quicker diffusion while preserving the usual and proven good properties (good periods, $\ell$-sequences, good statistical behaviors, etc.).[…]