Name
Abstract | ||
|---|---|---|
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 Coppersmith (1984)-here we concentrate on the use of computer algebra, in particular the new SCRATCHPAD system (Jenks, 1984). |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1016/S0747-7171(85)80018-3 | J. Symb. Comput. |
Keywords | DocType | Volume |
computer algebra,finite field,factoring polynomial,new SCRATCHPAD system | Journal | 1 |
Issue | ISSN | Citations |
2 | Journal of Symbolic Computation | 2 |
PageRank | References | Authors |
3.42 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Don Coppersmith | 1 | 4370 | 976.70 |
| J. H. Davenport | 2 | 109 | 21.82 |