Skip to main content
Book Chapter

The complexity of public-key cryptography

Springer International Publishing, (2017), 45-77
DOI: 10.1007/978-3-319-57048-8_2
19Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We survey the computational foundations for public-key cryptography. We discuss the computational assumptions that have been used as bases for publickey encryption schemes, and the types of evidence we have for the veracity of these assumptions.

Cite

CITATION STYLE

APA

Barak, B. (2017). The complexity of public-key cryptography. In Information Security and Cryptography (Vol. 0, pp. 45–77). Springer International Publishing. https://doi.org/10.1007/978-3-319-57048-8_2

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