東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

New hardware algorithms and designs ...

Gutub, Adnan Abdul-Aziz.

Linked to FindBook

Google Book

Amazon

博客來

New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n).

Record Type:	Language materials, printed : Monograph/item
Title/Author:	New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n)./
Author:	Gutub, Adnan Abdul-Aziz.
Description:	93 p.
Notes:	Adviser: Alexandre Ferreira Tenca.
Contained By:	Dissertation Abstracts International63-08B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3061894
ISBN:	0493777253

New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n).
Gutub, Adnan Abdul-Aziz.

New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n). - 93 p.

Adviser: Alexandre Ferreira Tenca.

Thesis (Ph.D.)--Oregon State University, 2003.

The computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2<super>n</super>), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implementations to compute the Montgomery modular inverse. We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. The proposed designs have the hardware scalability feature, which means that the design can fit on constrained areas and still handle operands of any size. In order to have long-precision calculations, the module works on small precision words. The word-size, on which the module operates, can be selected based on the area and performance requirements. The upper limit on the operand precision is dictated only by the available memory to store the operands and internal results. The scalable module is in principle capable of performing infinite-precision Montgomery inverse computation of an integer, modulo a prime number.

ISBN: 0493777253Subjects--Topical Terms:

626642
Computer Science.

New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n).
LDR:02884nam 2200301 a 45 001 925925
005 20110419
008 110419s2003 eng d
020 $a 0493777253
035 $a (UnM)AAI3061894
035 $a AAI3061894
040 $a UnM $c UnM
100 1 $a Gutub, Adnan Abdul-Aziz. $3 1249425
245 1 0 $a New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n).
300 $a 93 p.
500 $a Adviser: Alexandre Ferreira Tenca.
500 $a Source: Dissertation Abstracts International, Volume: 63-08, Section: B, page: 3787.
502 $a Thesis (Ph.D.)--Oregon State University, 2003.
520 $a The computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2<super>n</super>), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implementations to compute the Montgomery modular inverse. We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. The proposed designs have the hardware scalability feature, which means that the design can fit on constrained areas and still handle operands of any size. In order to have long-precision calculations, the module works on small precision words. The word-size, on which the module operates, can be selected based on the area and performance requirements. The upper limit on the operand precision is dictated only by the available memory to store the operands and internal results. The scalable module is in principle capable of performing infinite-precision Montgomery inverse computation of an integer, modulo a prime number.
520 $a We also propose a scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2<super>n</super>) fields. We adjust and modify a GF(2<super>n</super>) Montgomery inverse algorithm to benefit from multi-bit shifting hardware features making it very similar to the proposed best design of GF(p) inversion hardware.
520 $a We compare all scalable designs with fully parallel ones based on the same basic inversion algorithm. All scalable designs consumed less area and in general showed better performance than the fully parallel ones, which makes the scalable design a very efficient solution for computing the long precision Montgomery inverse.
590 $a School code: 0172.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
690 $a 0984
710 2 0 $a Oregon State University. $3 625720
773 0 $t Dissertation Abstracts International $g 63-08B.
790 $a 0172
790 1 0 $a Tenca, Alexandre Ferreira, $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3061894