Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
749 results
-
-
Seminar
-
SemSecuElec
One Fault Can Go A Long Way
Speaker : Shivam Bhasin
*Abstract:* Fault attacks are considered among critical threat to embedded cryptography. This talk will be divided into in two parts. The first part of the talk will explore application of faults on advanced security primitives. We present persistent fault analysis introduced at CHES 2017 and its capability to bypass state of the art fault countermeasures as well as higher-order masking with one[…] -
-
-
Seminar
-
SemSecuElec
Schindler-Itoh/Wiemers revisited: recovering full RSA/ECC private key from noisy side-channel observations
Speaker : Victor Lomné et Thomas Roche
Side-channel attacks on public-key cryptography (i.e. modular exponentiation for RSA or scalar multiplication for ECC) often boils down to distinguishing the 0s from the 1s in the binary representation of the secret exponent (resp. secret scalar).When state-of-the-art countermeasures are implemented, this detection must be errorless: thanks to masking techniques, erroneous masked exponents (resp.[…] -
-
-
Seminar
-
SemSecuElec
Rank metric cryptography and its implementations
Speaker : Nicolas Aragon
In 2017, the NIST (National Institute for Standards and Technology) started astandardization process in order to select post-quantum encryption and digital signature schemes. Among the proposed solutions, two rank-metric based encryption schemes were selected for the second round of the standardization process: ROLLOand RQC.This raised questions about both the performance and the security of the[…] -
-
-
Seminar
-
Cryptography
Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices
Speaker : Olivier Bernard - Rennes
-
-
-
Seminar
-
Cryptography
Isogenies over Hessian Model of Elliptic Curves
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[…] -
-
-
Seminar
-
Cryptography
Binary codes, hyperelliptic curves, and the Serre bound
Speaker : Ivan Pogildiakov - Rennes
TBA lien: https://seminaire-c2.inria.fr/ -