Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
701 results
-
-
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
Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices
Speaker : Olivier Bernard - Rennes
-
-
-
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
Binary codes, hyperelliptic curves, and the Serre bound
Speaker : Ivan Pogildiakov - Rennes
TBA lien: https://seminaire-c2.inria.fr/ -
-
-
Seminar
-
Cryptography
On Rejection Sampling in Lyubashevsky's Signature Scheme
Speaker : Julien Devevey - ENS de Lyon
Lyubashevsky’s signatures are based on the Fiat-Shamir with aborts paradigm, whose central ingredient is the use of rejection sampling to transform (secret-key-dependent) signature samples into samples from a secret-key-independent distribution. The choice of these two underly- ing distributions is part of the rejection sampling strategy, and various instantiations have been considered up to this[…] -
-
-
Seminar
-
Cryptography
Implicit proofs of membership
Speaker : Olivier Blazy - Université Limoges
Smooth hash proof systems have been introduced by Cramer and shoup to build compact efficient cca2 encryption in the standard model. Since then, they found applications in a broad range of protocols from oblivious transfer to authenticated key exchange, passing by witness examples.<br/> In this talk, we will start by a panorama of languages that can be managed by such a primitive and then show how[…] -