定價
：NT$ 1560 元無庫存，下單後進貨(採購期約4~10個工作天)
下單可得紅利積點 ：46 點
商品簡介
作者簡介
目次
商品簡介
本書序言
Up-to-date, engaging coverage of essential topics
●Expanded coverage of cryptography including Elliptic curve photography; coverage of knapsack ciphers has been removed. Also, the important notion of homomorphic encryption is introduced in this edition.
●Coverage of recent numerical discoveries, including four new Mersenne primes; the largest known twin primes; the evidence supporting many important conjectures, and more.
●Coverage of new theoretical discoveries, such as the proof of weak Goldbach conjecture and the result that there is an algorithm to multiply two n-bit integers using O (nlog2 n) bit operations.
A proven approach
●Enhanced exercise sets have been examined and improved sets even further, plus several hundred new exercises, from routine to challenging. New computational and exploratory exercises are included.
●Connections with abstract algebra: The book does not assume prior knowledge of abstract algebra, but introduces some basic algebraic structures such as groups, rings, and fields.
●Available resources for the 7th Edition are posted on the Pearson media servers here.
本書特色
●Now available as a Pearson eText. This new interactive version of the book provides many interactive applets that can be used by students for some common computations in number theory and to help understand concepts and explore conjectures.
●A collection of cryptographic applets is provided along with algorithms for computations in number theory, These include applets for encryption, decryption, cryptanalysis, and cryptographic protocols, addressing both classical ciphers and the RSA cryptosystem. Cryptographic applets can be used for individual, group, and classroom activities.
Up-to-date, engaging coverage of essential topics
●Expanded coverage of cryptography including Elliptic curve photography; coverage of knapsack ciphers has been removed. Also, the important notion of homomorphic encryption is introduced in this edition.
●Coverage of recent numerical discoveries, including four new Mersenne primes; the largest known twin primes; the evidence supporting many important conjectures, and more.
●Coverage of new theoretical discoveries, such as the proof of weak Goldbach conjecture and the result that there is an algorithm to multiply two n-bit integers using O (nlog2 n) bit operations.
A proven approach
●Enhanced exercise sets have been examined and improved sets even further, plus several hundred new exercises, from routine to challenging. New computational and exploratory exercises are included.
●Connections with abstract algebra: The book does not assume prior knowledge of abstract algebra, but introduces some basic algebraic structures such as groups, rings, and fields.
●Available resources for the 7th Edition are posted on the Pearson media servers here.
本書特色
●Now available as a Pearson eText. This new interactive version of the book provides many interactive applets that can be used by students for some common computations in number theory and to help understand concepts and explore conjectures.
●A collection of cryptographic applets is provided along with algorithms for computations in number theory, These include applets for encryption, decryption, cryptanalysis, and cryptographic protocols, addressing both classical ciphers and the RSA cryptosystem. Cryptographic applets can be used for individual, group, and classroom activities.
作者簡介
Kenneth H. Rosen received his BS in mathematics from the University of Michigan - Ann Arbor (1972) and his PhD in mathematics from MIT (1976). Before joining Bell Laboratories in 1982, he held positions at the University of Colorado - Boulder, The Ohio State University - Columbus, and the University of Maine - Orono, where he was an associate professor of mathematics. While working at AT&T Laboratories, he taught at Monmouth University, teaching courses in discrete mathematics, coding theory, and data security.
目次
1.The Integers
2.Integer Representations and Operations
3.Greatest Common Divisors
4.Prime Numbers
5.Congruences
6.Applications of Congruences
7.Some Special Congruences
8.Arithmetic Functions
9.Cryptography
10.Primitive Roots
11.Applications of Primitive Roots and the Order of an Integer
12.Quadratic Residues
13.Decimal Fractions and Continued Fractions
14.Nonlinear Diophantine Equations and Elliptic Curves
15.The Gaussian Integers
2.Integer Representations and Operations
3.Greatest Common Divisors
4.Prime Numbers
5.Congruences
6.Applications of Congruences
7.Some Special Congruences
8.Arithmetic Functions
9.Cryptography
10.Primitive Roots
11.Applications of Primitive Roots and the Order of an Integer
12.Quadratic Residues
13.Decimal Fractions and Continued Fractions
14.Nonlinear Diophantine Equations and Elliptic Curves
15.The Gaussian Integers
購物須知
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。