# American Institute of Mathematical Sciences

• Previous Article
Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• AMC Home
• This Issue
• Next Article
Efficient implementation of elliptic curve cryptography in wireless sensors
May  2010, 4(2): 189-213. doi: 10.3934/amc.2010.4.189

## A filtering method for the hyperelliptic curve index calculus and its analysis

 1 Fakultät für Mathematik, Ruhr-Universität Bochum and Horst Gösrtz Institut für IT-Sicherheit, Universitätsstraße 150, D-44780 Bochum 2 Instituto de Matemática y Física, Universidad de Talca, Casilla 747, Talca

Received  June 2009 Revised  January 2010 Published  May 2010

We describe a filtering technique improving the performance of index-calculus algorithms for hyperelliptic curves. Filtering is a stage taking place between the relation search and the linear algebra. Its purpose is to eliminate redundant or duplicate relations, as well as reducing the size of the matrix, thus decreasing the time required for the linear algebra step.
This technique, which we call harvesting, is in fact a new strategy that subtly alters the whole index calculus algorithm. In particular, it changes the relation search to find many times more relations than variables, after which a selection process is applied to the set of the relations - the harvesting process. The aim of this new process is to extract a (slightly) overdetermined submatrix which is as small as possible. Furthermore, the size of the factor base also has to be readjusted, in order to keep the (extended) relation search faster than it would have been in an index calculus algorithm without harvesting. The size of the factor base must also be chosen to guarantee that the final matrix will be indeed smaller than it would be in an optimised index calculus without harvesting, thus also speeding up the linear algebra step.
The version of harvesting presented here is an improvement over an earlier version by the same authors. By means of a new selection algorithm, time-complexity can be reduced from quadratic to linear (in the size of the input), thus making its running time effectively negligible with respect to the rest of the index calculus algorithm. At the same time we make the process of harvesting more effective - in the sense that the final matrix should (on average) be smaller than with the earlier approach.
We present an analysis of the impact of harvesting (for instance, we show that its usage can improve index calculus performance by more than 30% in some cases), we show that the impact on matrix size is essentially independent on the genus of the curve considered, and provide an heuristic argument in support of the effectiveness of harvesting as one parameter (which defines how far the relation search is pushed) increases.
Citation: Roberto Avanzi, Nicolas Thériault. A filtering method for the hyperelliptic curve index calculus and its analysis. Advances in Mathematics of Communications, 2010, 4 (2) : 189-213. doi: 10.3934/amc.2010.4.189
 [1] M. J. Jacobson, R. Scheidler, A. Stein. Cryptographic protocols on real hyperelliptic curves. Advances in Mathematics of Communications, 2007, 1 (2) : 197-221. doi: 10.3934/amc.2007.1.197 [2] Elisa Gorla, Maike Massierer. Index calculus in the trace zero variety. Advances in Mathematics of Communications, 2015, 9 (4) : 515-539. doi: 10.3934/amc.2015.9.515 [3] Michael J. Jacobson, Jr., Monireh Rezai Rad, Renate Scheidler. Comparison of scalar multiplication on real hyperelliptic curves. Advances in Mathematics of Communications, 2014, 8 (4) : 389-406. doi: 10.3934/amc.2014.8.389 [4] Roberto Avanzi, Michael J. Jacobson, Jr., Renate Scheidler. Efficient reduction of large divisors on hyperelliptic curves. Advances in Mathematics of Communications, 2010, 4 (2) : 261-279. doi: 10.3934/amc.2010.4.261 [5] Stefan Erickson, Michael J. Jacobson, Jr., Andreas Stein. Explicit formulas for real hyperelliptic curves of genus 2 in affine representation. Advances in Mathematics of Communications, 2011, 5 (4) : 623-666. doi: 10.3934/amc.2011.5.623 [6] Laurent Imbert, Michael J. Jacobson, Jr.. Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2^m}$. Advances in Mathematics of Communications, 2013, 7 (4) : 485-502. doi: 10.3934/amc.2013.7.485 [7] Rodrigo Abarzúa, Nicolas Thériault, Roberto Avanzi, Ismael Soto, Miguel Alfaro. Optimization of the arithmetic of the ideal class group for genus 4 hyperelliptic curves over projective coordinates. Advances in Mathematics of Communications, 2010, 4 (2) : 115-139. doi: 10.3934/amc.2010.4.115 [8] Christopher M. Kribs-Zaleta. Sharpness of saturation in harvesting and predation. Mathematical Biosciences & Engineering, 2009, 6 (4) : 719-742. doi: 10.3934/mbe.2009.6.719 [9] D. Novikov and S. Yakovenko. Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems. Electronic Research Announcements, 1999, 5: 55-65. [10] Frank Sottile. The special Schubert calculus is real. Electronic Research Announcements, 1999, 5: 35-39. [11] Fabrizio Colombo, Graziano Gentili, Irene Sabadini and Daniele C. Struppa. A functional calculus in a noncommutative setting. Electronic Research Announcements, 2007, 14: 60-68. doi: 10.3934/era.2007.14.60 [12] Gokhan Yener, Ibrahim Emiroglu. A q-analogue of the multiplicative calculus: Q-multiplicative calculus. Discrete & Continuous Dynamical Systems - S, 2015, 8 (6) : 1435-1450. doi: 10.3934/dcdss.2015.8.1435 [13] Bernard Dacorogna, Giovanni Pisante, Ana Margarida Ribeiro. On non quasiconvex problems of the calculus of variations. Discrete & Continuous Dynamical Systems - A, 2005, 13 (4) : 961-983. doi: 10.3934/dcds.2005.13.961 [14] Daniel Faraco, Jan Kristensen. Compactness versus regularity in the calculus of variations. Discrete & Continuous Dynamical Systems - B, 2012, 17 (2) : 473-485. doi: 10.3934/dcdsb.2012.17.473 [15] Vladimir V. Kisil. Mobius transformations and monogenic functional calculus. Electronic Research Announcements, 1996, 2: 26-33. [16] Michael Herty, Veronika Sachers. Adjoint calculus for optimization of gas networks. Networks & Heterogeneous Media, 2007, 2 (4) : 733-750. doi: 10.3934/nhm.2007.2.733 [17] Z. G. Feng, Kok Lay Teo, N. U. Ahmed, Yulin Zhao, W. Y. Yan. Optimal fusion of sensor data for Kalman filtering. Discrete & Continuous Dynamical Systems - A, 2006, 14 (3) : 483-503. doi: 10.3934/dcds.2006.14.483 [18] Andrew J. Majda, John Harlim, Boris Gershgorin. Mathematical strategies for filtering turbulent dynamical systems. Discrete & Continuous Dynamical Systems - A, 2010, 27 (2) : 441-486. doi: 10.3934/dcds.2010.27.441 [19] H. Thomas Banks, Shuhua Hu, Zackary R. Kenz, Hien T. Tran. A comparison of nonlinear filtering approaches in the context of an HIV model. Mathematical Biosciences & Engineering, 2010, 7 (2) : 213-236. doi: 10.3934/mbe.2010.7.213 [20] Tianliang Yang, J. M. McDonough. Solution filtering technique for solving Burgers' equation. Conference Publications, 2003, 2003 (Special) : 951-959. doi: 10.3934/proc.2003.2003.951

2018 Impact Factor: 0.879