My Account Details

ISBN10: 0071545816 | ISBN13: 9780071545815

Step 1 . Download Adobe Digital Editions to your PC or Mac desktop/laptop.
Step 2. Register and authorize your Adobe ID (optional). To access your eBook on multiple devices, first create an Adobe ID at account.adobe.com. Then, open Adobe Digital Editions, go to the Help menu, and select "Authorize Computer" to link your Adobe ID.
Step 3. Open Your eBook. Use Adobe Digital Editions to open the file. If the eBook doesn’t open, contact customer service for assistance.
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
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
Need support? We're here to help - Get real-world support and resources every step of the way.