10 research outputs found
The arithmetic of Jacobian groups of superelliptic cubics
International audienceWe present two algorithms for the arithmetic of cubic curves with a totally ramified prime at infinity. The first algorithm, inspired by Cantor's reduction for hyperelliptic curves, is easily implemented with a few lines of code, making use of a polynomial arithmetic package. We prove explicit reducedness criteria for superelliptic curves of genus 3 and 4, which show the correctness of the algorithm. The second approach, quite general in nature and applicable to further classes of curves, uses the FGLM algorithm for switching between Gröbner bases for different orderings. Carrying out the computations symbolically, we obtain explicit reduction formulae in terms of the input data
On Using Expansions to the Base of -2
This short note investigates the effects of using expansions to the base of
-2. The main applications we have in mind are cryptographic protocols, where
the crucial operation is computation of scalar multiples. For the recently
proposed groups arising from Picard curves this leads to a saving of at least
7% for the computation of an m-fold. For more general non-hyperelliptic genus 3
curves we expect a larger speed-up.Comment: 5 page
GEOMETRIC ASPECTS OF THE ADDITION ALGORITHM ON THE PICARD GROUP OF A Cab CURVE
In the previous paper [3], we proposed to use the Picard group of the plane model, which is so-called Cab model admitting singularities, of a curve of any genus for realizing a faster addition algorithm on the Jacobian group of the curve. In the paper, we present the explicit addition algorithm on the Picard group of a Cab curve from the geometric view point, which will give a generalization of Cantor’s algorithm on the Jacobian group of a hyperelliptic curves and a supplement of the argument given in [4]
A Generic Approach to Searching for Jacobians
We consider the problem of finding cryptographically suitable Jacobians. By
applying a probabilistic generic algorithm to compute the zeta functions of low
genus curves drawn from an arbitrary family, we can search for Jacobians
containing a large subgroup of prime order. For a suitable distribution of
curves, the complexity is subexponential in genus 2, and O(N^{1/12}) in genus
3. We give examples of genus 2 and genus 3 hyperelliptic curves over prime
fields with group orders over 180 bits in size, improving previous results. Our
approach is particularly effective over low-degree extension fields, where in
genus 2 we find Jacobians over F_{p^2) and trace zero varieties over F_{p^3}
with near-prime orders up to 372 bits in size. For p = 2^{61}-1, the average
time to find a group with 244-bit near-prime order is under an hour on a PC.Comment: 22 pages, to appear in Mathematics of Computatio
Discrete logarithms in curves over finite fields
A survey on algorithms for computing discrete logarithms in Jacobians of
curves over finite fields
Index calculus in class groups of non-hyperelliptic curves of genus three
The original publication is available at www.springerlink.comDescriptionInternational audienceWe study an index calculus algorithm to solve the discrete logarithm problem (DLP) in degree~0 class groups of non-hyperelliptic curves of genus~3 over finite fields. We present a heuristic analysis of the algorithm which indicates that the DLP in degree~0 class groups of non-hyperelliptic curves of genus~3 can be solved in an expected time of soft-O(q). This heuristic result relies on one heuristic assumption which is studied experimentally. We also present experimental data which show that a variant of the algorithm is faster than the Rho method even for small group sizes, and we address practical limitations of the algorithm
Discrete logarithms in curves over finite fields
International audienceA survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields
Recent Application in Biometrics
In the recent years, a number of recognition and authentication systems based on biometric measurements have been proposed. Algorithms and sensors have been developed to acquire and process many different biometric traits. Moreover, the biometric technology is being used in novel ways, with potential commercial and practical implications to our daily activities. The key objective of the book is to provide a collection of comprehensive references on some recent theoretical development as well as novel applications in biometrics. The topics covered in this book reflect well both aspects of development. They include biometric sample quality, privacy preserving and cancellable biometrics, contactless biometrics, novel and unconventional biometrics, and the technical challenges in implementing the technology in portable devices. The book consists of 15 chapters. It is divided into four sections, namely, biometric applications on mobile platforms, cancelable biometrics, biometric encryption, and other applications. The book was reviewed by editors Dr. Jucheng Yang and Dr. Norman Poh. We deeply appreciate the efforts of our guest editors: Dr. Girija Chetty, Dr. Loris Nanni, Dr. Jianjiang Feng, Dr. Dongsun Park and Dr. Sook Yoon, as well as a number of anonymous reviewers