SaleHardback
COMPTIA SECURITY ALL-IN-ONE EXAM GUIDE (EXAM SY0-301)
₹1,200 ₹960
Save: 20%
COMPUTER-AIDED MANUFACTURING, 3RD EDN
₹1,270 ₹889
Save: 30%
COMPUTATIONAL NUMBER THEORY
Publisher:
T&F INDIA
| Author:
ABHIJIT DAS
| Language:
English
| Format:
Hardback
₹995 ₹796
Save: 20%
In stock
Ships within:
1-4 Days
11
People watching this product now!
In stock
ISBN:
Category: Uncategorized
Page Extent:
614
Developed from the author’s popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and practitioners of cryptography in industry. Requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. It first builds the foundation of computational number theory by covering the arithmetic of integers and polynomials at a very basic level. It then discusses elliptic curves, primality testing, algorithms for integer factorization, computing discrete logarithms, and methods for sparse linear systems. The text also shows how number-theoretic tools are used in cryptography and cryptanalysis. A dedicated chapter on the application of number theory in public-key cryptography incorporates recent developments in pairing-based cryptography. With an emphasis on implementation issues, the book uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.
Rated 0 out of 5
0 reviews
Rated 5 out of 5
0
Rated 4 out of 5
0
Rated 3 out of 5
0
Rated 2 out of 5
0
Rated 1 out of 5
0
Be the first to review “COMPUTATIONAL NUMBER THEORY” Cancel reply
Description
Developed from the author’s popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and practitioners of cryptography in industry. Requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. It first builds the foundation of computational number theory by covering the arithmetic of integers and polynomials at a very basic level. It then discusses elliptic curves, primality testing, algorithms for integer factorization, computing discrete logarithms, and methods for sparse linear systems. The text also shows how number-theoretic tools are used in cryptography and cryptanalysis. A dedicated chapter on the application of number theory in public-key cryptography incorporates recent developments in pairing-based cryptography. With an emphasis on implementation issues, the book uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.
About Author
Abhijit Das is an associate professor in the Department of Computer Science and Engineering at the Indian Institute of Technology, Kharagpur. His research interests are in the areas of arithmetic and algebraic computations with specific applications to cryptology.
Rated 0 out of 5
0 reviews
Rated 5 out of 5
0
Rated 4 out of 5
0
Rated 3 out of 5
0
Rated 2 out of 5
0
Rated 1 out of 5
0
Reviews
Clear filtersThere are no reviews yet.
Be the first to review “COMPUTATIONAL NUMBER THEORY” Cancel reply
Reviews
Clear filtersThere are no reviews yet.