An application of factoring (Q1081302): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q247220
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: James H. Davenport / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IBM Scratchpad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of logarithms in fields of characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726006 / rank
 
Normal rank

Latest revision as of 15:10, 17 June 2024

scientific article
Language Label Description Also known as
English
An application of factoring
scientific article

    Statements

    An application of factoring (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references