| 000 -LEADER |
|---|
| fixed length control field |
02624 a2200265 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250604151428.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250604b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9780521516440 |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 SHO/C |
| 100 ## - MAIN ENTRY--AUTHOR NAME |
|---|
| Personal name |
Shoup, Victor |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
A computational introduction to number theory and algebra |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher |
Cambridge University Press |
| Year of publication |
c2009 |
| Place of publication |
Cambridge |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
xvii, 580p.; 25cm. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Table of Contents:<br/><br/>Preface<br/>Preliminaries<br/><br/>1. Basic properties of the integers<br/>2. Congruences<br/>3. Computing with large integers<br/>4. Euclid's algorithm<br/>5. The distribution of primes<br/>6. Abelian groups<br/>7. Rings<br/>8. Finite and discrete probability distributions<br/>9. Probabilistic algorithms<br/>10. Probabilistic primality testing<br/>11. Finding generators and discrete logarithms in Z*p<br/>12. Quadratic reciprocity and computing modular square roots<br/>13. Modules and vector spaces<br/>14. Matrices<br/>15. Subexponential-time discrete logarithms and factoring<br/>16. More rings<br/>17. Polynomial arithmetic and applications<br/>18. Linearly generated sequences and applications<br/>19. Finite fields<br/>20. Algorithms for finite fields<br/>21. Deterministic primality testing<br/><br/>Appendix: some useful facts<br/>Bibliography<br/>Index of notation<br/>Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch. Thus the book can serve several purposes. It can be used as a reference and for self-study by readers who want to learn the mathematical foundations of modern cryptography. It is also ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer science |
| General subdivision |
Mathematical principles |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer algebra |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computational geometry |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Mathematics |
| General subdivision |
Algorithmics |
| -- |
Complexity |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Information theory and coding |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
https://www.cambridge.org/core/books/computational-introduction-to-number-theory-and-algebra/6DBE79226210EB629448E57A1C65E985 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Book |
