東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The Montgomery algorithm.

Mason, Linwood, Jr.

Linked to FindBook

Google Book

Amazon

博客來

The Montgomery algorithm.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The Montgomery algorithm./
Author:	Mason, Linwood, Jr.
Description:	40 p.
Notes:	Source: Masters Abstracts International, Volume: 48-03, page: 1662.
Contained By:	Masters Abstracts International48-03.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1478628
ISBN:	9781109606683

The Montgomery algorithm.
Mason, Linwood, Jr.

The Montgomery algorithm. - 40 p.

Source: Masters Abstracts International, Volume: 48-03, page: 1662.

Thesis (M.S.)--University of Central Missouri, 2009.

Modular division impacts everyone because everyone uses computers. Humans must wait for cell phones, cars, traffic lights, and many other electronic devices to connect or to change status. Some form of modular reduction is employed by every computing device; especially those involving electronic security, which in today's world means everything electronic. Montgomery's algorithm promises to reduce your wait by eliminating unnecessary modular division. Under laboratory conditions, using a high-level compiler language (GCC) and two-industry standard cryptographic systems which require modular exponentiation, our research realized this efficiency. In particular, we were able to significantly reduce computer processing time compared to conventional algorithms. The implications of increasing efficiency include faster, more secure cell phone connections, less wait time for secure browser connections, and potentially a host of other everyday benefits.

ISBN: 9781109606683Subjects--Topical Terms:

515831
Mathematics.

The Montgomery algorithm.
LDR:01692nam 2200253 4500 001 1397341
005 20110719084904.5
008 130515s2009 ||||||||||||||||| ||eng d
020 $a 9781109606683
035 $a (UMI)AAI1478628
035 $a AAI1478628
040 $a UMI $c UMI
100 1 $a Mason, Linwood, Jr. $3 1676166
245 1 4 $a The Montgomery algorithm.
300 $a 40 p.
500 $a Source: Masters Abstracts International, Volume: 48-03, page: 1662.
502 $a Thesis (M.S.)--University of Central Missouri, 2009.
520 $a Modular division impacts everyone because everyone uses computers. Humans must wait for cell phones, cars, traffic lights, and many other electronic devices to connect or to change status. Some form of modular reduction is employed by every computing device; especially those involving electronic security, which in today's world means everything electronic. Montgomery's algorithm promises to reduce your wait by eliminating unnecessary modular division. Under laboratory conditions, using a high-level compiler language (GCC) and two-industry standard cryptographic systems which require modular exponentiation, our research realized this efficiency. In particular, we were able to significantly reduce computer processing time compared to conventional algorithms. The implications of increasing efficiency include faster, more secure cell phone connections, less wait time for secure browser connections, and potentially a host of other everyday benefits.
590 $a School code: 0429.
650 4 $a Mathematics. $3 515831
650 4 $a Engineering, Computer. $3 1669061
690 $a 0405
690 $a 0464
710 2 $a University of Central Missouri. $3 1020616
773 0 $t Masters Abstracts International $g 48-03.
790 $a 0429
791 $a M.S.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1478628