An application of factoring (Q1081302): Difference between revisions

We explain how factoring polynomials over finite fields can be used in computing logarithms in fields of characteristic two, and how this has applications in cryptography. This letter describes work which is described in more detail in the first author's paper in IEEE Trans. Inf. Theory IT-30, 587-594 (1984; Zbl 0554.12013) - here we concentrate on the use of computer algebra, in particular the new SCRATCHPAD system [\textit{R. D. Jenks}, Lect. Notes Comput. Sci. 174, 123-147 (1984)].