Cantitate/Preț
Produs
Total produse
Vezi coșul
Fundamentals of Cryptography: Introducing Mathematical and Algorithmic Foundations de Duncan Buell

Fundamentals of Cryptography: Introducing Mathematical and Algorithmic Foundations: Undergraduate Topics in Computer Science

Autor Duncan Buell
en Limba Engleză Paperback – 16 iun 2021
Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible.

This unique textbook text balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually “does”, not a mathematical game one proves theorems about. There is deep math; there are some theorems that must be proved; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the “easy” ways to break the cryptography. This text covers the algorithmic foundations and is complemented by core mathematics and arithmetic.
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 25878 lei

Preț vechi: 32348 lei
-20% Nou

Puncte Express: 388
Preț estimativ în valută:
4953€ • 5144$ • 4114£

Carte disponibilă

Livrare economică 11-25 ianuarie 25
Livrare express 31 decembrie 24 - 04 ianuarie 25 pentru 2977 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030734916
ISBN-10: 3030734919
Pagini: 279
Ilustrații: XV, 279 p. 50 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.42 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

1. Introduction.- 2. Simple Ciphers.- 3. Divisibility, Congruences, and Modular Arithmetic.- 4. Groups, Rings, Fields.- 5. Square Roots and Quadratic Symbols.- 6. Finite Fields of Characteristic 2.- 7. Elliptic Curves.- 8. Mathematics, Computing, and Arithmetic.- 9. Modern Symmetric Ciphers — DES and AES.- 10. Asymmetric Ciphers — RSA and Others.- 11. How to Factor a Number.- 12. How to Factor More Effectively.- 13. Cycles, Randomness, Discrete Logarithms, and Key
Exchange.- 14. Elliptic Curve Cryptography.- 15. Quantum Computing and Cryptography.- 16. Lattice-Based Cryptography.- 17. Homomorphic Encryption.- 18. Exercises.

Notă biografică

Duncan Buell, professor emeritus in the Dept. of Computer Science and Engineering at University of South Carolina, also has 15 years of experience at a research lab doing high-performance computing research in support of the US National Security Agency.

Textul de pe ultima copertă

Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible.
This unique and accessible textbook balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually “does”, not a mathematical game about which one proves theorems. There is deep math; there are some theorems that must be proven; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the “easy” ways to break the cryptography. Hence, this text covers the algorithmic foundations and is complemented by core mathematics and arithmetic.
Topics and features:
  • Provides an exhaustive set of useful examples, to optimally convey thecryptographic computations
  • Focuses on doing cryptography, rather than on proving theorems
  • Includes detailed source code and a test suite
  • Describes NTRU as a lattice-based cryptographic algorithm
  • Addresses, among other topics, factoring attacks (including their history), elliptic curve cryptography, quantum cryptography, and homomorphic encryption
This clearly written introductory textbook emphasizes how implementation issues affect algorithm decisions and will reinforce learning for computer science (or mathematics) students studying cryptography at the undergraduate level.  In addition, it will be ideal for professional short courses or self-study.
Duncan Buell, professor emeritus in the Dept. of Computer Science and Engineering at University of South Carolina, also has 15 years of experience at a research lab doing high-performance computing research in support of the U.S. National Security Agency.

Caracteristici

Balances the theorems of mathematics against the feasibility of computation Covers the algorithmic foundations as well core mathematics and arithmetic Demonstrates how cryptography is something one actually “does,” rather than theorizes about