Elementary Number Theory, Cryptography and Codes
In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and codin...
Main Authors: | , , |
---|---|
Corporate Author: | |
Format: | Electronic |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2009.
|
Series: | Universitext
|
Subjects: | |
Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-540-69200-3 |
Table of Contents:
- 1 A round-up on numbers
- 2 Computational complexity
- 3 From the infinite to the finite
- 4 Finite is not enough: factorising integers
- 5 Finite fields and polynomial congruences
- 6 Primality and factorisation tests
- 7 Secrets. . . and lies
- 8 Transmitting without. . . fear of errors
- 9 The future is already here: quantum cryptography
- 10 Solution to selected exercises
- References
- Index.