An introduction to mathematical cryptography

  title={An introduction to mathematical cryptography},
  author={Jeffrey Hoffstein and Jill Pipher and Joseph H. Silverman},
This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. This text provides an ideal… 
Comparison between the RSA cryptosystem and elliptic curve cryptography
This thesis provides an overview and comparison between the RSA cryptosystem and elliptic curve cryptography, which both focus on sending and receiving messages, and shows that the reliability and strong security of the RSA Cryptosystem depends on the degree of difficulty of integer factorization.
Mathematics of Public Key Cryptography
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.
Cryptography and Secure Communication
Major branches of classical and modern cryptography are discussed in detail, from basic block and stream cyphers through to systems based on elliptic and hyperelliptic curves, accompanied by concise summaries of the necessary mathematical background.
Discrete Logarithms and Elliptic Curves in Cryptography
The mathematical foundations, shortcomings, and novel variants of the “first” public key cryptosystem envisioned by Whitfield Diffie, Martin Hellman, and Ralph Merkle in 1976 are surveyed as well as a comparison of these systems with standard RSA encryption.
Introduction to Mathematical Cryptography
In this chapter, cryptography is introduced and a brief overview of the subject with its basic goal is presented both intuitively and mathematically.
Post-quantum cryptography: lattice-based cryptography and analysis of NTRU public-key cryptosystem
The scrutiny done since its presentation until now reveal that NTRU is secure and is a good successor for replacing the current constructions currently in use, which makes it considerably faster than RSA and ECC.
Practical Cryptography: Algorithms and Implementations Using C++
Practical Cryptography explains how you can use cryptography to maintain the privacy of computer data and shows you how to build security into your computer applications, networks, and storage.
In this work I propose a new symmetric fully homomorphic encryption powered by Exterior Algebra and Product Spaces, more specifically by Geometric Algebra as a mathematical language for creating
A brief survey of the discrete logarithm problem
A brief survey of some of the best known algorithms for solving the Discrete Logarithm Problem, examines their computing time, and considers the DLP over two particular …nite groups.
Algebraic Aspects of Number Theory
Chapter 10 discusses some more interesting properties of integers, in particular, properties of prime numbers and primality testing by using the tools of modern algebra, which are not studied in