000 04516nam a22005655i 4500
001 978-3-030-73492-3
003 DE-He213
005 20240423130108.0
007 cr nn 008mamaa
008 210615s2021 sz | s |||| 0|eng d
020 _a9783030734923
_9978-3-030-73492-3
024 7 _a10.1007/978-3-030-73492-3
_2doi
050 4 _aQA76.9.A25
072 7 _aUR
_2bicssc
072 7 _aUTN
_2bicssc
072 7 _aCOM053000
_2bisacsh
072 7 _aUR
_2thema
072 7 _aUTN
_2thema
082 0 4 _a005.8
_223
100 1 _aBuell, Duncan.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aFundamentals of Cryptography
_h[electronic resource] :
_bIntroducing Mathematical and Algorithmic Foundations /
_cby Duncan Buell.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXV, 279 p. 50 illus., 1 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x2197-1781
505 0 _a1. 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.
520 _aCryptography, 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.
650 0 _aData protection.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aComputer science.
650 1 4 _aData and Information Security.
650 2 4 _aCryptology.
650 2 4 _aTheory and Algorithms for Application Domains.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030734916
776 0 8 _iPrinted edition:
_z9783030734930
830 0 _aUndergraduate Topics in Computer Science,
_x2197-1781
856 4 0 _uhttps://doi.org/10.1007/978-3-030-73492-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c184993
_d184993