An application of factoring

Authors:
D. Coppersmith;J. H. Davenport
Affiliations:
Mathematical Sciences Department, IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, U.S.A.;School of Mathematics, University of Bath, Bath BA2 7AY, England
Venue:
Journal of Symbolic Computation
Year:
1985

Citing 3
Cited 2

A Primer: 11 Keys to New Scratchpad

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
New directions in cryptography

IEEE Transactions on Information Theory
Fast evaluation of logarithms in fields of characteristic two

IEEE Transactions on Information Theory

Solving Large Sparse Linear Systems over Finite Fields

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Massively Parallel Computation of Discrete Logarithms

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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).