Abstract
This paper presents an analysis of the Herlestam and Johannesson (“Swedish”) algorithm, which heuristically computes discrete logarithms in GF(2p) using an iterative procedure. An equivalent variation of the algorithm that allows a much cleaner, easier and algebraically more organized approach to the algorithm’s process is described. A further modification to the algorithm which yields specific performance improvements is given. Analysis of these methods is made through probability distributions which are appropriately selected to model the heuristic’s performance. The significance of the algorithm is addressed by further comparing these methods to a procedure in which movement between iterations is governed by a random process rather than by a directed criterion.
On leave from the University of Lowell.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Berkovits, J. Kowalchuk, and B. P. Schanning, Implemeptipg Public Kpy Schgmp, IEEE Communication Magazine, May 1979 Vol. 17, No. 3.
E. F. Brickell and J. H. Moore. “Some remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2p)”. Advapces ip ÇFypCpgrapby: Prpcppding$ of Cryptp 82. Plenum Publishing Corporation, New York, 1983.
T. Herlestam and R. Johannesson, On Compjnpu jAg Logarithms. Oyer CF(2P), 1981 IEEE International Symposium on Information Theory, Santa Monica, California, February 1981. (See also: BIT 21, 1981.)
T. Herlestam and R. Johannesson, Private Communication.
J. E. Mosimann, “Statistical Problems of Size and Shape: Characterizations of the Lognormal, Gamma, and Dirichlet Distributions,” Stariapical Diapribi4ipns,g ScipnP,i“c Work, Vol. 2, G. P. Patil S. Kolz, J. K. Ord (ed.), D. Reidel Publishing Co., Dordrecht-Holland, Boston, 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Sachs, J.E., Berkovits, S. (1984). Probabilistic Analysis and Performance Modelling of the ‘Swedish’ Algorithm and Modifications. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_21
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4730-9_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4732-3
Online ISBN: 978-1-4684-4730-9
eBook Packages: Springer Book Archive