DeepRead
Cover of The mathematics of public key cryptography

The mathematics of public key cryptography

Steven D. Galbraith · 2012

Tech industry, hacking and security books › Cryptography and security engineering

#13,525 most recommended

About the book

The book covers the mathematics behind public key cryptography, from elementary number theory and finite fields to factoring, discrete logarithms, elliptic and hyperelliptic curves, and isogenies. It is written for students and researchers in mathematics, computer science and electrical engineering, and works both as an advanced textbook and as a reference. The book is mainly an exposition rather than a single thesis. It holds that the security of each public key scheme rests on a specific mathematical problem, so a reader needs the underlying algebra to judge what a system depends on. It presents the main algorithms that attack these problems, such as the Pollard methods and Maurer's reduction, alongside the constructions that use them, with proofs and worked examples. It also places the subject in its historical development.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

01220192020202120222019 peak · 1
This bookAverage book in Cryptography and security engineering

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2012
ISBN
9781280393334
Editions known
12 at Open Library
Open Library
OL16283056W

Coding theoryCryptographyMATHEMATICS / Discrete MathematicsMathematics

Explore in the mosaic

Read next: its neighbours on the mosaic