000			03998nam a22003855i 4500
999			_c361591 _d361591 _x1
001			361591
003			ES-MaUEC
005			20230102121412.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210615s2021 sz | o |||| 0|eng d
020			_a9783030734923
024	7		_a10.1007/978-3-030-73492-3 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .A25 _b2021 EB
100	1		_aBull, Duncan _9681229
245	1	0	_aFundamentals of Cryptography _bIntroducing Mathematical and Algorithmic Foundations _cby Duncan Buell.
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (XV, 279 páginas) _b50 ilustraciones, 1 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aUndergraduate Topics in Computer Science _x2197-1781
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
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	3		_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 the cryptographic 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.
988			_aSpringer_Computer_2021
650		7	_2embne _9413101 _aCriptografía
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-73492-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2022 _dz _eh _zSI