Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2009.
|
| Edición: | 1st ed. 2009. |
| Colección: | Universitext,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-69200-3 | ||
| 003 | DE-He213 | ||
| 005 | 20220113134658.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2009 gw | s |||| 0|eng d | ||
| 020 | |a 9783540692003 |9 978-3-540-69200-3 | ||
| 024 | 7 | |a 10.1007/978-3-540-69200-3 |2 doi | |
| 050 | 4 | |a QA241-247.5 | |
| 072 | 7 | |a PBH |2 bicssc | |
| 072 | 7 | |a MAT022000 |2 bisacsh | |
| 072 | 7 | |a PBH |2 thema | |
| 082 | 0 | 4 | |a 512.7 |2 23 |
| 100 | 1 | |a Baldoni, M. Welleda. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Elementary Number Theory, Cryptography and Codes |h [electronic resource] / |c by M. Welleda Baldoni, Ciro Ciliberto, G.M. Piacentini Cattaneo. |
| 250 | |a 1st ed. 2009. | ||
| 264 | 1 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2009. | |
| 300 | |a XVI, 522 p. 10 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Universitext, |x 2191-6675 | |
| 505 | 0 | |a A round-up on numbers -- Computational complexity -- From infinite to finite -- Finite is not enough: factoring integers -- Finite fields and polynomial congruences -- Primality and factorisation tests -- Secrets... and lies -- Transmitting without...fear of errors -- The future is already here: quantum cryptography. | |
| 520 | |a 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 coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the use of algebraic geometry, specifically of elliptic curves over finite fields, is illustrated, and a final chapter is devoted to quantum cryptography, which is the new frontier of the field. Coding theory is not discussed in full; however a chapter, sufficient for a good introduction to the subject, has been devoted to linear codes. Each chapter ends with several complements and with an extensive list of exercises, the solutions to most of which are included in the last chapter. Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics. | ||
| 650 | 0 | |a Number theory. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 0 | |a Geometry. | |
| 650 | 0 | |a Algebra. | |
| 650 | 1 | 4 | |a Number Theory. |
| 650 | 2 | 4 | |a Discrete Mathematics. |
| 650 | 2 | 4 | |a Data Structures and Information Theory. |
| 650 | 2 | 4 | |a Geometry. |
| 650 | 2 | 4 | |a Algebra. |
| 700 | 1 | |a Ciliberto, Ciro. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 700 | 1 | |a Piacentini Cattaneo, G.M. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783540865070 |
| 776 | 0 | 8 | |i Printed edition: |z 9783540691990 |
| 830 | 0 | |a Universitext, |x 2191-6675 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-540-69200-3 |z Texto Completo |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||