Reference : On the Reduction of Composed Relations from the Number Field Sieve
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/2280
On the Reduction of Composed Relations from the Number Field Sieve
English
Denny, Thomas [> >]
Müller, Volker mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
1996
Proceedings of the 2nd Algorithmic Number Theory Symposium (ANTS II)
Springer-Verlag
75-90
Yes
No
International
978-3540615811
Algorithmic Number Theory Symposium II
May 18 - 23, 1996
Talence
France
[en] Number field sieve ; Discrete logarithm
[en] A very important step in the number field sieve for computing dis­crete loga­rithms in finite fields is the combination of so called relations. These combina­tions are used in the final linear algebra step to find the discrete logarithm. From a practical point of view, it is highly desirable to find combinations with as few as possible non zero entries, since this property speeds up the linear alge­bra part. In this paper we present a new algorithm for computing combina­tions which shows significant im­pro­ve­m­ents in practice to existing other algorithms.
http://hdl.handle.net/10993/2280
1122
Proceed­ings of Algorithmic Number Theory Symposium II, LNCS

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.