An application of factoring
From MaRDI portal
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)].
Recommendations
Cites work
- Fast evaluation of logarithms in fields of characteristic two
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- New directions in cryptography
Cited in
(4)
This page was built for publication: An application of factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081302)