Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
741 results
-
-
Seminar
-
SemSecuElec
Calibration Done Right: Noiseless Flush+Flush Attacks
Speaker : Guillaume Didier
Caches leak information through timing measurements and so-called side-channel attacks. Several primitives exist with different requirements and trade-offs. Flush+Flush is a stealthy and fast cache attack primitive that uses the timing of the clflush instruction depending on the presence of a line in the cache. However, the CPU interconnect plays a bigger role than thought in these timings, and[…] -
-
-
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/ -
-
-
Seminar
-
Cryptography
New uses in Symmetric Cryptography: from Cryptanalysis to Designing
Speaker : Clémence Bouvier - INRIA
New symmetric primitives are being designed to be run in abstract settings such as Multi-Party Computations (MPC) or Zero-Knowledge (ZK) proof systems. More particularly, these protocols have highlighted the need to minimize the number of multiplications performed by the primitive in large finite fields.<br/> As the number of such primitives grows, it is important to better understand the[…] -
-
-
Seminar
-
Cryptography
PMNS for efficient arithmetic and small memory cost
Speaker : Fangan Yssouf Dosso - Ecole des Mines de Saint-Etienne
The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, E is a monic polynomial with integer coefficients, having g as a root modulo p. Most of the work done on PMNS focus on polynomials E such that E(X) = X^n – l, where l is[…] -