Hardware Implementation of Finite-Field Arithmetic
Series: ELECTRONICS;
- Publisher's listprice GBP 99.99
-
47 770 Ft (45 495 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 4 777 Ft off)
- Discounted price 42 993 Ft (40 946 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
47 770 Ft
Availability
cancelled
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher McGraw Hill
- Date of Publication 16 April 2009
- ISBN 9780071545815
- Binding Hardback
- No. of pages360 pages
- Size 236x160x29 mm
- Weight 632 g
- Language English 0
Categories
Short description:
Implement Finite-Field Arithmetic in Specific Hardware (FPGA and ASIC)
Master cutting-edge electronic circuit synthesis and design with help from this detailed guide. Hardware Implementation of Finite-Field Arithmetic describes algorithms and circuits for executing finite-field operations, including addition, subtraction, multiplication, squaring, exponentiation, and division.
This comprehensive resource begins with an overview of mathematics, covering algebra, number theory, finite fields, and cryptography. The book then presents algorithms which can be executed and verified with actual input data. Logic schemes and VHDL models are described in such a way that the corresponding circuits can be easily simulated and synthesized. The book concludes with a real-world example of a finite-field application-elliptic-curve cryptography. This is an essential guide for hardware engineers involved in the development of embedded systems.
Get detailed coverage of:
- Modulo m reduction
- Modulo m addition, subtraction, multiplication, and exponentiation
- Operations over GF(p) and GF(pm)
- Operations over the commutative ring Zp[x]/f(x)
- Operations over the binary field GF(2m) using normal, polynomial, dual, and triangular
Long description:
Publisher's Note: Products purchased from Third Party sellers are not guaranteed by the publisher for quality, authenticity, or access to any online entitlements included with the product.
Implement Finite-Field Arithmetic in Specific Hardware (FPGA and ASIC)
Master cutting-edge electronic circuit synthesis and design with help from this detailed guide. Hardware Implementation of Finite-Field Arithmetic describes algorithms and circuits for executing finite-field operations, including addition, subtraction, multiplication, squaring, exponentiation, and division.
This comprehensive resource begins with an overview of mathematics, covering algebra, number theory, finite fields, and cryptography. The book then presents algorithms which can be executed and verified with actual input data. Logic schemes and VHDL models are described in such a way that the corresponding circuits can be easily simulated and synthesized. The book concludes with a real-world example of a finite-field application--elliptic-curve cryptography. This is an essential guide for hardware engineers involved in the development of embedded systems.
Get detailed coverage of:
- Modulo m reduction
- Modulo m addition, subtraction, multiplication, and exponentiation
- Operations over GF(p) and GF(pm)
- Operations over the commutative ring Zp[x]/f(x)
- Operations over the binary field GF(2m) using normal, polynomial, dual, and triangular
Publisher's Note: Products purchased from Third Party sellers are not guaranteed by the publisher for quality, authenticity, or access to any online entitlements included with the product.
Implement Finite-Field Arithmetic in Specific Hardware (FPGA and ASIC)
Master cutting-edge electronic circuit synthesis and design with help from this detailed guide. Hardware Implementation of Finite-Field Arithmetic describes algorithms and circuits for executing finite-field operations, including addition, subtraction, multiplication, squaring, exponentiation, and division.
This comprehensive resource begins with an overview of mathematics, covering algebra, number theory, finite fields, and cryptography. The book then presents algorithms which can be executed and verified with actual input data. Logic schemes and VHDL models are described in such a way that the corresponding circuits can be easily simulated and synthesized. The book concludes with a real-world example of a finite-field application--elliptic-curve cryptography. This is an essential guide for hardware engineers involved in the development of embedded systems.
Get detailed coverage of:
- Modulo m reduction
- Modulo m addition, subtraction, multiplication, and exponentiation
- Operations over GF(p) and GF(pm)
- Operations over the commutative ring Zp[x]/f(x)
- Operations over the binary field GF(2m) using normal, polynomial, dual, and triangular
Table of Contents:
Chapter 1. Mathematical background
Chapter 2. Mod m reduction
Chapter 3. Mod m operations
Chapter 4. Operations over GF(p)
Chapter 5. Operations over Zp [x] / f(x)
Chapter 6. Operations over GF(pn)
Chapter 7. Operations over GF(2m) - Polynomial bases
Chapter 8. Operations over GF(2m) - Normal bases
Chapter 9. Operations over GF(2m) - Other bases
Chapter 10. Elliptic curve cryptographyAppendix A. p = 2(192) - 2(64) - 1
Appendix B. Optical Extension Fields
Appendix C. Binary Fields
Appendix D. Ada versus VHDL
Index
