Integer factorization and discrete logarithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Integer factorization and discrete logarithms have been known for a long time as fundamental problems of computational number theory. The invention of public key cryptography in the 1970s then led to a dramatic increase in their perceived importance. Currently the only widely used and trusted public key cryptosystems rely for their pre- sumed security on the difficulty of these two problems. This makes the complexity of these problems of interest to the wide public, and not just to specialists. This lecture will present a survey of the state of the art in integer factorization and discrete logarithms. Special attention will be devoted to the rate of progress in both hardware and algorithms. Over the last quarter century, these two factors have contributed about equally to the progress that has been made, and each has stimulated the other. Some projections for the future will also be made. Most of the material covered in the lecture is available in the survey papers [1,2] and the references listed there.

Original languageEnglish (US)
Title of host publicationLATIN 2000
Subtitle of host publicationTheoretical Informatics - 4th Latin American Symposium, Proceedings
EditorsAlfredo Viola, Gaston H. Gonnet, Daniel Panario
PublisherSpringer- Verlag
Number of pages1
ISBN (Print)3540673067, 3540673067, 9783540673064
StatePublished - Jan 1 2000
Event4th Latin American Symposium on Theoretical Informatics, LATIN 2000 - Punta del Este, Uruguay
Duration: Apr 10 2000Apr 14 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other4th Latin American Symposium on Theoretical Informatics, LATIN 2000
CityPunta del Este


Dive into the research topics of 'Integer factorization and discrete logarithms'. Together they form a unique fingerprint.

Cite this