Skip to main content
Conference ProceedingsOPEN ACCESS

Intractable problems in number theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 403 LNCS 77-93
DOI: 10.1007/0-387-34799-2_7
3Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper surveys computational problems related to integer factorization and the calculation of discrete logarithms in various groups. Its aim is to provide theory sufficient for the derivation of heuristic running time estimates, and at the same time introduce algorithms of practical value.

Cite

CITATION STYLE

APA

Bach, E. (1990). Intractable problems in number theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 403 LNCS, pp. 77–93). Springer Verlag. https://doi.org/10.1007/0-387-34799-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free