An application of factoring
type: Item
instance of: scholarly article
title: An application of factoring
zbMATH Open document ID: 0601.68033
DOI: 10.1016/S0747-7171(85)80018-3
author: Don Coppersmith
author: James H. Davenport
published in: Journal of Symbolic Computation
publication date: 1985-01-01T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11T55
zbMATH DE Number: 3970108
zbMATH Keywords: factoring polynomials over finite fields
zbMATH Keywords: computing logarithms in fields of characteristic two
zbMATH Keywords: cryptography
describes a project that uses: IBM Scratchpad
MaRDI profile type: Publication
cites work: Q5550483
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: New directions in cryptography
cites work: Q3935355
cites work: Q3726006
description: scientific article; zbMATH DE number 3970108