東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Optimal signed-binary recoding for c...

Ruan, Xiaoyu.

FindBook

Google Book

Amazon

博客來

Optimal signed-binary recoding for cryptography.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Optimal signed-binary recoding for cryptography./
作者:	Ruan, Xiaoyu.
面頁冊數:	96 p.
附註:	Adviser: Rajendra S. Katti.
Contained By:	Dissertation Abstracts International69-02B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303239
ISBN:	9780549492658

Optimal signed-binary recoding for cryptography.
Ruan, Xiaoyu.

Optimal signed-binary recoding for cryptography. - 96 p.

Adviser: Rajendra S. Katti.

Thesis (Ph.D.)--North Dakota State University, 2007.

The central topic of this dissertation is the alternating greedy expansion and the minimal joint weight expansion of integers. Both expansions are defined to be signed-binary representations with digits {-1, 0, 1} as opposed to {0,1} in the normal binary number system. The alternating greedy expansion of an integer is the unique expansion with the property that nonzero digits have alternating signs. The minimal joint weight expansion of integers has the minimal number of nonzero columns among all possible expansions with {-1, 0, 1} of the given integers.

ISBN: 9780549492658Subjects--Topical Terms:

626642
Computer Science.

Optimal signed-binary recoding for cryptography.
LDR:02113nam 2200289 a 45 001 941206
005 20110518
008 110518s2007 ||||||||||||||||| ||eng d
020 $a 9780549492658
035 $a (UMI)AAI3303239
035 $a AAI3303239
040 $a UMI $c UMI
100 1 $a Ruan, Xiaoyu. $3 1265338
245 1 0 $a Optimal signed-binary recoding for cryptography.
300 $a 96 p.
500 $a Adviser: Rajendra S. Katti.
500 $a Source: Dissertation Abstracts International, Volume: 69-02, Section: B, page: 1222.
502 $a Thesis (Ph.D.)--North Dakota State University, 2007.
520 $a The central topic of this dissertation is the alternating greedy expansion and the minimal joint weight expansion of integers. Both expansions are defined to be signed-binary representations with digits {-1, 0, 1} as opposed to {0,1} in the normal binary number system. The alternating greedy expansion of an integer is the unique expansion with the property that nonzero digits have alternating signs. The minimal joint weight expansion of integers has the minimal number of nonzero columns among all possible expansions with {-1, 0, 1} of the given integers.
520 $a This dissertation first gives two algorithms for computing the alternating greedy expansion of an integer from unisigned-binary expansion and signed-binary expansion from left to right; i.e., from the column with the most significant bits towards the column with the least significant bits, respectively. It then proposes an algorithm for computing a minimal joint weight expansion of d integers (d ≥ 1) from their normal binary representation with alternating greedy expansion as the intermediate step. This algorithm operates from left to right. The minimal joint weight expansion is very useful in speeding up the operations in public-key elliptic curve cryptosystems.
590 $a School code: 0157.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
690 $a 0984
710 2 $a North Dakota State University. $3 1021724
773 0 $t Dissertation Abstracts International $g 69-02B.
790 $a 0157
790 1 0 $a Katti, Rajendra S., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303239