We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to... more
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research.
We use a combination of metrics to un- derstand, model, and evaluate the impact of Pair Pro- gramming on software development. Pair Program- ming is a core technique in the hot process paradigm of Extreme Programming. At the expense of... more
We use a combination of metrics to un- derstand, model, and evaluate the impact of Pair Pro- gramming on software development. Pair Program- ming is a core technique in the hot process paradigm of Extreme Programming. At the expense of increased personnel cost, Pair Programming aims at increasing both the team productivity and the code quality as com- pared to
This paper presents a design-space exploration of an application- specic instruction-set processor (ASIP) for the computation of various crypto- arithmetic in these elds is crucial for fast com- putation of pairings. Moreover, computation... more
This paper presents a design-space exploration of an application- specic instruction-set processor (ASIP) for the computation of various crypto- arithmetic in these elds is crucial for fast com- putation of pairings. Moreover, computation of cryptographic pairings is much more complex than elliptic-curve cryptography (ECC) in general. Therefore, we facilitate programming of the proposed ASIP by providing a C compiler. In
Abstract. We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings... more
Abstract. We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop ...
In this paper we show an efficient implementation of the Tate, ate and R-ate pairings in magma. This will be demonstrated by using the KSS curves with embedding degree k = 18.
