Integer factorization and discrete logarithms

Andrew Odlyzko

doi:10.1007/10719839_26

Integer factorization and discrete logarithms

Andrew Odlyzko

School of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	LATIN 2000
Subtitle of host publication	Theoretical Informatics - 4th Latin American Symposium, Proceedings
Editors	Alfredo Viola, Gaston H. Gonnet, Daniel Panario
Publisher	Springer Verlag
Pages	258
Number of pages	1
ISBN (Print)	3540673067, 3540673067, 9783540673064
DOIs	https://doi.org/10.1007/10719839_26
State	Published - 2000
Event	4th Latin American Symposium on Theoretical Informatics, LATIN 2000 - Punta del Este, Uruguay Duration: Apr 10 2000 → Apr 14 2000

Publication series

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

Other

Other	4th Latin American Symposium on Theoretical Informatics, LATIN 2000
Country/Territory	Uruguay
City	Punta del Este
Period	4/10/00 → 4/14/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Publisher link

10.1007/10719839_26

Find It

Find It at U of M Libraries

Cite this

Odlyzko, A. (2000). Integer factorization and discrete logarithms. In A. Viola, G. H. Gonnet, & D. Panario (Eds.), LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings (pp. 258). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1776). Springer Verlag. https://doi.org/10.1007/10719839_26

Integer factorization and discrete logarithms. / Odlyzko, Andrew.
LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings. ed. / Alfredo Viola; Gaston H. Gonnet; Daniel Panario. Springer Verlag, 2000. p. 258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1776).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Odlyzko, A 2000, Integer factorization and discrete logarithms. in A Viola, GH Gonnet & D Panario (eds), LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1776, Springer Verlag, pp. 258, 4th Latin American Symposium on Theoretical Informatics, LATIN 2000, Punta del Este, Uruguay, 4/10/00. https://doi.org/10.1007/10719839_26

Odlyzko A. Integer factorization and discrete logarithms. In Viola A, Gonnet GH, Panario D, editors, LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings. Springer Verlag. 2000. p. 258. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/10719839_26

Odlyzko, Andrew. / Integer factorization and discrete logarithms. LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings. editor / Alfredo Viola ; Gaston H. Gonnet ; Daniel Panario. Springer Verlag, 2000. pp. 258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{86e14d86af4641e3afda782ea0d147eb,

title = "Integer factorization and discrete logarithms",

abstract = "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.",

author = "Andrew Odlyzko",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 4th Latin American Symposium on Theoretical Informatics, LATIN 2000 ; Conference date: 10-04-2000 Through 14-04-2000",

year = "2000",

doi = "10.1007/10719839_26",

language = "English (US)",

isbn = "3540673067",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "258",

editor = "Alfredo Viola and Gonnet, {Gaston H.} and Daniel Panario",

booktitle = "LATIN 2000",

}

TY - GEN

T1 - Integer factorization and discrete logarithms

AU - Odlyzko, Andrew

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

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

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

UR - http://www.scopus.com/inward/record.url?scp=84958074481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958074481&partnerID=8YFLogxK

U2 - 10.1007/10719839_26

DO - 10.1007/10719839_26

M3 - Conference contribution

AN - SCOPUS:84958074481

SN - 3540673067

SN - 9783540673064

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 258

BT - LATIN 2000

A2 - Viola, Alfredo

A2 - Gonnet, Gaston H.

A2 - Panario, Daniel

PB - Springer Verlag

T2 - 4th Latin American Symposium on Theoretical Informatics, LATIN 2000

Y2 - 10 April 2000 through 14 April 2000

ER -

Integer factorization and discrete logarithms

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this