Welcome to the resource topic for 2014/346
Title:
Time-Memory Trade-offs for Index Calculus in Genus 3
Authors: Kim Laine, Kristin Lauter
Abstract:In this paper, we present a variant of Diem’s \widetilde{O}(q) index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field \mathbb{F}_q. We implement this new variant in C++ and study the complexity in both theory and practice, making the logarithmic factors and constants hidden in the \widetilde{O}-notation precise. Our variant improves the computational complexity at the cost of a moderate increase in memory consumption, but we also improve the computational complexity even when we limit the memory usage to that of Diem’s original algorithm. Finally, we examine how parallelization can help to reduce both the memory cost per computer and the running time for our algorithms.
ePrint: https://eprint.iacr.org/2014/346
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .