faster pairing computations on curves with high-degree twists.
Published 12 years ago • 300 plays • Length 26:05Download video MP4
Download video MP3
Similar videos
-
56:23
pairings on elliptic curves - parameter selection and efficient computation
-
27:33
optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition
-
22:00
faster montgomery and double-add ladders for short weierstrass curves
-
55:10
elliptic curves, cryptography and computation
-
19:45
a short-list of pairing-friendly curves resistant to special tnfs at the 128-bit security level
-
27:16
pairing-based cryptography
-
10:14
elliptic curves and modular forms | the proof of fermat’s last theorem
-
4:41
15 elliptic curve multiple point addition
-
7:04
how to solve a cryptogram - twitterati cryptograms
-
33:29
emmanuel fouotsa | efficient computation of the final exponentiation in paring-based cryptography
-
18:25
faster computation of isogenies of large prime degree
-
23:04
families of snark-friendly 2-chains of elliptic curves
-
41:56
elliptic curves, group law, and efficient computation
-
2:39
quadratic twists of elliptic curves with small selmer rank
-
0:55
find all points on elliptic curve
-
21:02
pairings iii - supersingular curves
-
47:23
kristin lauter (microsoft) / optimizations for elliptic curve and pairing-based cryptography with...
-
12:24
elliptic curve back door - computerphile
-
1:04:53
elliptic curves: facts, conjectures and applications
-
57:28
(4,4)-split jacobians of curves of genus 2
-
3:39
faster computation of the tate pairing