Mathematics of Public Key Cryptography
Public key cryptography is a major interdisciplinary subject with many real-world applications, such as digital signatures. A strong background in the mathematics underlying public key cryptography is essential for a deep understanding of the subject, and this book provides exactly that for students and researchers in mathematics, computer science and electrical engineering. Carefully written to communicate the major ideas and techniques of public key cryptography to a wide readership, this text is enlivened throughout with historical remarks and insightful perspectives on the development of the subject. Numerous examples, proofs and exercises make it suitable as a textbook for an advanced course, as well as for self-study. For more experienced researchers it serves as a convenient reference for many important topics: the Pollard algorithms, Maurer reduction, isogenies, algebraic tori, hyperelliptic curves and many more.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Part I Background
Part II Algebraic groups
Part III Exponentiation factoring and discrete logarithms
Part IV Lattices
Part V Cryptography related todiscrete logarithms
Part VI Cryptography related tointeger factorisation
adversary algebraic group algebraic set attack basis bit operations char(k Chinese remainder theorem choose ciphertext collision complexity computational problem consider Corollary cryptography cryptosystem curve over 1k decryption deﬁned Deﬁnition deg(u(x degree Diffie–Hellman discrete logarithm problem distinguished point divisor class group E(Fq efficient Elgamal Elgamal encryption elliptic curve encryption equation Example Exercise expected number exponentiation factor ﬁeld finite fields ﬁrst Fixed-CDH follows Frobenius genus given gives graph group elements group operations hash function Hence heuristic homomorphism hyperelliptic curve IND-CCA input integer irreducible isogeny isomorphism kangaroo lattice Lemma Let g matrix method modulo morphism multiplication Note output pairing polynomial polynomial-time prime order probability Proof Prove public key quadratic random oracle randomised rational map reduction requires result roots Schnorr Schnorr signatures Section Show subgroup supersingular Suppose Theorem uniformiser uniformly at random values vector walk Weierstrass equation write Z/NZ