Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
The process of recognizing individual handwritten characters is one of classifying curves. Typically, handwriting recognition systems-even "online" systems--require enti...
These notes cover several topics such as Predicting Asset Returns, Linear Factor Model, Linear Factor Models in SDF Form, Consumption-Based Asset Pricing, Riskneutral Distributions...
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 cryptograph...
Steven D. Galbraith, Florian Hess, Frederik Vercau...