Article

Article title PARALLEL ALGORITHM FOR GENERAL NUMBER FIELD SIEVE DISCRETE LOG METHOD
Authors Babenko L. K., Sidorov I. D.
Section SECTION IV. METHODS AND MEANS OF CRYPTOGRAPHY AND STEGANOGRAPHY
Month, Year 08, 2008 @en
Index UDC 681.3.06
DOI
Abstract In the article questions of parallel implementation of the most efficient known method for discrete log – general number field sieve – are taken into consideration. The algorithms are represented, that allow to make different stages of computation parallel. Some experimental results are shown.

Download PDF

Keywords cryptography, discrete log, parallel computations.
References 1. Ростовцев А.Г., Маховенко Е.Б. Теоретическая криптография. – СПб.: АНО НПО «Профессионал», 2005. – 480 с.
2. Gordon D. Discrete Logarithms in GF(p) using the Number Field Sieve //SIAM Journal on Discrete Mathematics. 1993, Vol. 6 p. 124-138.
3. Weber D. Computing discrete logarithms with the number field sieve. //Algorithmic Number Theory: Second international Symposium, ANTS-II. Talence, France, May 1996.
Processing, Lecture notes in Computer Science. Springer-Verlag, 1996. Vol 1122, p. 391-403.
4. Шнайер Б. Прикладная криптография. Протоколы, алгоритмы, исходные тексты на языке Си. – М.: Изд-во ТРИУМФ, 2003. – 816 с.

Comments are closed.