Xinxin Fan
Xinxin Fan
Home
Publications
Media Coverage
Industry Contributions
Talks
Light
Dark
Automatic
1
Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based …
Xinxin Fan
,
Guang Gong
,
David Jao
Cite
DOI
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical …
Xinxin Fan
,
Guang Gong
,
David Jao
Cite
DOI
Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
We analyze all the cases and propose the corresponding explicit formulae for computing $2D_1 + D_2$ in one step from given divisor …
Xinxin Fan
,
Guang Gong
Cite
DOI
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is the scalar multiplication by an integer $k$, …
Xinxin Fan
,
Thomas Wollinger
,
Yumin Wang
Cite
DOI
Inversion-Free Arithmetic on Genus 3 Hyperelliptic Curves and Its Implementations
Recently, a lot of effort has been done to investigate all kinds of explicit formulae for speeding up group operation of hyperelliptic …
Xinxin Fan
,
Thomas Wollinger
,
Yumin Wang
Cite
DOI
Simultaneous Divisor Class Addition-Subtraction Algorithm and Its Applications to Hyperelliptic Curve Cryptosystem
In [H. Oguro et al., (2003)], the authors proposed efficient algorithms for the $\tau$-adic sliding window method and applied the …
Xinxin Fan
,
Yumin Wang
Cite
DOI
«
Cite
×