Description
Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of pairing and pairing-friendly curves have varying pros and cons with respect to the design of protocol and parameter. All these led us to make a distributable and efficient library that will incorporate various pairing-friendly curves with the different security levels. In this talk, I will share the path we followed to make such library for all who are working directly or indirectly with pairing-based cryptography.
Prochains exposés
-
Algorithms for post-quantum commutative group actions
Orateur : Marc Houben - Inria Bordeaux
At the historical foundation of isogeny-based cryptography lies a scheme known as CRS; a key exchange protocol based on class group actions on elliptic curves. Along with more efficient variants, such as CSIDH, this framework has emerged as a powerful building block for the construction of advanced post-quantum cryptographic primitives. Unfortunately, all protocols in this line of work are[…] -
Endomorphisms via Splittings
Orateur : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-