Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields

Das, Abhijit and Madhavan, Veni CE (1999) Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. In: 10th International Symposium on Algorithms and Computation, ISAAC'99, December 1999, Chennai, India, pp. 295-306.

PDF Performance.pdf - Published Version Restricted to Registered users only Download (160kB) | Request a copy

Abstract

It is of interest in cryptographic applications to obtain practical performance improvements for the discrete logarithm problem over prime fields F-p with p of size less than or equal to 500 bits. The linear sieve and the cubic sieve methods described in Coppersmith, Odlyzko and Schroeppels paper [3] are two practical algorithms for computing discrete logarithms over prime fields. The cubic sieve algorithm is asymptotically faster than the linear sieve algorithm. We discuss an efficient implementation of the cubic sieve algorithm incorporating two heuristic principles. We demonstrate through empirical performance measures that for a special class of primes the cubic sieve method runs about two to three times faster than the linear sieve method even in cases of small prime fields of size about 150 bits.

Item Type:	Conference Paper
Publication:	Algorithms And Computations
Publisher:	Springer Verlag
Additional Information:	Copyright for this article belongs to Springer Verlag.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	05 Oct 2004
Last Modified:	10 Jan 2012 09:57
URI:	http://eprints.iisc.ac.in/id/eprint/1675

Actions (login required)

View Item