New hardware algorithms and designs for Montgomery modular inverse computation in Galois Fields GF(p) and GF(2 [superscript n])

Description

Graduation date: 2003

Links & Downloads

1. http://hdl.handle.net/1957/31590

Tags

Modular functions

Algorithms

Functions, Inverse

Finite fields (Algebra)

Public key cryptography

Additional Fields

Identifer	oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/31590
Date	11 June 2002
Creators	Gutub, Adnan Abdul-Aziz
Contributors	Tenca, Alexandre Ferreira
Source Sets	Oregon State University
Language	en_US
Detected Language	English
Type	Thesis/Dissertation