Filter by content type

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

Remove all filters

702 results

    • Seminar

    • SemSecuElec

    Une approche pour l’accélération matérielle pour le chiffrement homomorphe

    • December 14, 2018

    • CEA List

    Speaker : Joël Cathebras

    Le chiffrement homomorphe est un outil cryptographique permettant la manipulation de données en aveugle. Son utilisation généralisée permettrait de proposer des solutions de calcul déporté impliquant des données confidentielles, par exemple des données génomiques pour la médecine personnalisée. Cependant, le chiffrement homomorphe doit faire face à de grandes complexités mémoires et calculatoires.[…]
    • Seminar

    • SemSecuElec

    Unique CAD-compatible SCA-security mechanisms, externally amplified coupling (EAC) attacks and (some) connection

    • June 25, 2021

    • Bar-Ilan University (BIU) - Web-Conférence

    Speaker : Itamar Levi

    In this seminar I will first discuss unique computer aided design (CAD) compatible SCA security mechanisms. I will present an approach which can significantly increase the physical security-level of a design, be implemented with conventional design-tools and which does not require any special technological-support. The method consists with a correct by-design utilization of power-management[…]
    • Seminar

    • Cryptography

    Elliptic curves for SNARKs

    • September 01, 2022

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

    Speaker : Youssef El Housni - LIX

    At CANS’20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) made of the former BLS12-377 curve (a Barreto–Lynn–Scott curve over a 377- bit prime field) and the new BW6-761 curve (a Brezing–Weng curve of embedding degree 6 over a 761-bit prime field). First we generalise the[…]
    • Seminar

    • Cryptography

    New Representations of the AES Key Schedule

    • June 10, 2022

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

    Speaker : Clara Pernot - INRIA Paris

    In this talk we present a new representation of the AES key schedule, with some implications to the security of AES-based schemes. In particular, we show that the AES-128 key schedule can be split into four independent parallel computations operating on 32 bits chunks, up to linear transformation. Surprisingly, this property has not been described in the literature after more than 20 years of[…]
    • Seminar

    • Cryptography

    Fault tolerant algorithms via decoding: Interleaving techniques

    • June 17, 2022

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

    Speaker : Eleonora Guerrini - Université Montpellier

    Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed by an untrusted entity). In this talk we will present algorithms to[…]
    • Seminar

    • Cryptography

    Isogenies over Hessian Model of Elliptic Curves

    • June 03, 2022

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

    Speaker : Emmanuel Fouotsa - Université de Bamenda

    In this talk we present explicit formulas for isogenies between elliptic curves in (twisted) Hessian form. We examine the numbers of operations in the base field to compute the formulas. In comparison with other isogeny formulas, we note that the obtained formulas for twisted Hessian curves have the lowest costs for processing the kernel and the X-affine formula has the lowest cost for processing[…]