Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering

Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering")

個数：

Hardware Implementation of Finite-Field Arithmetic (Electronic Engineering")

DesChamps, Jean-Pierre

ウェブストア価格 ¥31,887（本体¥28,989）
McGraw-Hill Companies（2009/03発売）
外貨定価 US$ 152.00
ポイント 289pt

オンデマンド(OD/POD)版です。キャンセルは承れません。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Hardcover:ハードカバー版／ページ数 360 p.
言語 ENG
商品コード 9780071545815
DDC分類 621.395

基本説明

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, and more.

Full Description

Publisher's Noteguaranteed 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 reductionModulo m addition, subtraction, multiplication, and exponentiationOperations 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 1. Mathematical backgroundChapter 2. Mod m reductionChapter 3. Mod m operationsChapter 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 basesChapter 8. Operations over GF(2m) - Normal basesChapter 9. Operations over GF(2m) - Other basesChapter 10. Elliptic curve cryptographyAppendix A. p = 2(192) - 2(64) - 1Appendix B. Optical Extension FieldsAppendix C. Binary FieldsAppendix D. Ada versus VHDLIndexNER(01): WOW