An application of factoring (Q1081302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An application of factoring |
scientific article; zbMATH DE number 3970108 |
Statements
An application of factoring (English)
0 references
1985
0 references
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)].
0 references
factoring polynomials over finite fields
0 references
computing logarithms in fields of characteristic two
0 references
cryptography
0 references
0.7812417149543762
0 references
0.7634003162384033
0 references
0.7625353336334229
0 references
0.7621022462844849
0 references
