
Applied Algebra
Pearson (Publisher)
Published on 3. September 2002
Book
Hardback
420 pages
978-0-13-067464-7 (ISBN)
Description
For junior/senior-level courses in Abstract Algebra and Cryptography in departments of mathematics, computer science, and engineering. Emphasizing the fact that solid mathematics leads to solid applications, this text builds a mathematical foundation that includes topics in number theory and the theory of infinite fields. - Hints for using Maple, MultiPAD, and Scientific Notebook. - Supplies students with explicit examples of how to use these technology products to perform calculations related to the course, and enables them to better understand the ideas developed in the text. - An entire chapter devoted to the Rijndael Algorithm - Featuresm the interesting mathematics upon which it is based. - Enables students to focus on and understand the recently adopted Advanced Encryption Standard (replacing the Data Encryption Standard) as the default for financial and web transactions. - Solutions to selected exercises. - Shows students how the solution was worked out - not just the correct answer. - A comprehensive presentation. - Provides students with numerous topics in cryptology, number theory, and error correcting codes - not found in other texts.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 240 mm
Width: 182 mm
Thickness: 20 mm
Weight
771 gr
ISBN-13
978-0-13-067464-7 (9780130674647)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
1. Integers and Computer Algebra.
2. Codes.
3. Euclidean Algorithm.
4. Ciphers.
5. Error Control Codes.
6. Chinese Remainder Theorem.
7. Theorems of Fermat and Euler.
8. Public Key Ciphers.
9. Finite Fields.
10. Error-Correcting Codes.
11. Advanced Encryption Standard.
12. Polynomial Algorithms and Fast Fourier Transforms.
Appendix A: Hints for Using Technology.
Appendix B: Solutions to Selected Exercises.
Bibliography.
Index.
2. Codes.
3. Euclidean Algorithm.
4. Ciphers.
5. Error Control Codes.
6. Chinese Remainder Theorem.
7. Theorems of Fermat and Euler.
8. Public Key Ciphers.
9. Finite Fields.
10. Error-Correcting Codes.
11. Advanced Encryption Standard.
12. Polynomial Algorithms and Fast Fourier Transforms.
Appendix A: Hints for Using Technology.
Appendix B: Solutions to Selected Exercises.
Bibliography.
Index.