Abstract
Style and purpose.This is a rather basic set of lectures in algorithms, with an advanced focus. Cryptography and randomization are discussed as non trivial fields of algorithm application. Contents. Six lectures organized as follows: 1. Coding and encryption of information. Basic concepts on representing num-bers, sets, and algorithms. An overview on cryptography and its development in history. 2. Algorithmic paradigms and computational complexity. Iteration and recur-sion. Lower and upper bounds on time and space. 3. Tractable and intractable problems. The classes P, NP, NP-hard. 4. The role of randomization. Random sources and random number generators. Hash functions. Randomized algorithms. 5. Symmetric and asymmetric cryptography. From DES to AES. Public key cryptosystems and RSA. 6. Cryptography on the Web. Identification, authentication, and digital signa-tures. Certification Authorities. The protocol SSL.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luccio, F., Pagli, L. (2002). From Algorithms to Cryptography Tutorial. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive