This thesis deals primarily with the eastern Islamic world during the period 1000-40. It attempts to delineate the structure of the Ghaznavid empire, its personal and administrative aspect (Part I) and its military aspect (Part II). The material used in Part II has already appeared in substantially similar form as "Ghaznevid military organisation" in Der Islam, XXXVI, 1960, 37-77. Against this background, the province of Khurasan under Ghaznavid rule, and in particular, the city of Nishapur, are described (Part III). The irruption of the Seljuqs is treated in Part V. However, a survey of what is known of the Oghuz before these migrations is prefixed to this (Part IV). It summarises presently-held views, attempting to synthesise the work of Central Asian specialists, Turcologists, historians and archaeologists, who alone are competent to investigate at first hand this difficult subject. The scope of the thesis is therefore that of the decline of Ghaznavid power in the west, and it is this aspect which has been concentrated upon, for the early years of the Great Seljuq dynasty have already been extensively covered by such scholars as Cl. Cahen, I. Kafesoğlu and M.A. Köymen, and the administrative system of the Seljuqs has been examined by A.K.S. Lambton in her London University thesis on Seljuq institutions. This thesis has been prepared under the joint supervision of the Rev. Dr. W. Montgomery Watt and Mr. J.R. Walsh, to whom I am greatly indebted for help and encouragement; from the latter, in particular, I have enjoyed much stimulating conversation and judicious guidance through the literature of the period.

In the present work we study a linearization framework for assessing the security of hash functions and analyze the proposal of hash function BLAKE. The thesis demonstrates a limitation of a method presented in the linearization framework for which the method could not be applied to the full extent. Further in the thesis, it is explained how to find a message difference for second preimage attack with the help of linear codes. To that end, a matrix representing the linearized compression function of BLAKE is constructed. My thesis as a PDF file and source codes of computations that I created in Mathematica software are on an enclosed CD.

Pseudorandom generators belong to the primary focus of cryptology. The key to every cipher has to be generated at random, otherwise the security of the whole cipher is threatened. Another point of importance is the pseudorandom generators' close relationship to the stream ciphers. In this work, we first introduce statistical theory related to randomness testing. Then, we describe 8 classical statistical tests. We introduce a concept of next bit testing and derive variants of previous tests. Moreover, with this new battery of tests we examine the randomness of SHA-3 second round candidates and present the results. Also a sensitivity of tests is investigated and several useful transformations are shown. Powered by TCPDF (www.tcpdf.org)

In today’s society blockchains and the Internet of things are two very discussed subjects this has led to thoughts about combining them by using a blockchain in Internet of things. This objective of this study has been to solve the problem which hashing algorithms is the best for a blockchain used in an Internet of things network. This have been done by first selecting a few hashing algorithms and setting up a scenario where a blockchain can be used in an Internet of things network. After that I specified what to compare, speed, input length and output length. The study has been conducted with the aid of literary studies about the hashing algorithms and a program that implements the algorithms and tests their speed. The study has shown that out of the selected hashing algorithms MD5, SHA-256, SHA3-256 with the conditions specified for the study that the hashing algorithm SHA3-256 is the best option if speed is not of the utmost importance in the scenario since it is from a newer standard and do not have a max input length. If speed is the very important in other words if SHA3-256 is to slow then SHA-256 would be best for the Internet of things network.

Thesis (M.A.)--香港中文大學. / Reprint of manuscript. / Includes bibliographical references (leaves 122-125). / Thesis (M.A.)--Xianggang Zhong wen da xue. / 前言 --- p.2 / Chapter 一 --- 棉紡織手工業在中國的發展 --- p.4 / Chapter 二 --- 洋紗洋布入侵與棉紡織手工業的解體 --- p.18 / Chapter 三 --- 大生紗廠之籌款經過 --- p.50 / Chapter 四 --- 大生紗廠的成功擴張與失敗 --- p.76 / Chapter 五 --- 大生紗廠的組織與管理 --- p.88 / Chapter 六 --- 大生紗廠成敗的討論 --- p.101 / Chapter 七 --- 結論 --- p.115 / Chapter 附一 --- 大生紗廠大事年表 --- p.119 / Chapter 附二 --- 主要參考書目

Leung Cheuk Kin. / "Architecture Department, Chinese University of Hong Kong, Master of Architecture Programme 2002-2003, design report." / Background --- p.1 / Research Study --- p.9 / Introduction --- p.9 / Basic Information --- p.12 / Analysis --- p.21 / Conclusion --- p.31 / Site Selection / Analysis --- p.32 / Design --- p.40 / Diagrams --- p.41 / Drawings --- p.43 / Models --- p.51

With growing trend in "cloud computing" and increase in the data moving into the Internet, the need to store large amounts of data by service providers such as Google, Yahoo and Microsoft has increased over time. Now, more than ever, there is a need to efficiently and securely store large amounts of data. This thesis presents an implementation of a Ramp Scheme that confidentially splits a data file into a configurable number of parts or shares of equal size such that a subset of those shares can recover the data entirely. Furthermore, the implementation supports a threshold for data compromise and data verification to verify that the data parts have not been tampered with. This thesis addresses two key problems faced in large-scale data storage, namely, data availability and confidentiality.

published_or_final_version / Housing Management / Master / Master of Housing Management

published_or_final_version / abstract / Urban Design / Master / Master of Urban Design

published_or_final_version / Architecture / Master / Master of Landscape Architecture