Avoiding full extension field arithmetic in pairing computations

The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree subfields. Consequently, full extension field operations have the greatest effect on the runtime of Miller’s algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subfield operations encountered throughout an iteration of Miller’s algorithm. Unfortunately, almost all of these improvements tend to suffer for larger embedding degrees where the expensive extension field operations far outweigh the operations in the smaller subfields. In this paper, we propose a new way of carrying out Miller’s algorithm that involves new explicit formulas which reduce the number of full extension field operations that occur in an iteration of the Miller loop, resulting in significant speed ups in most practical situations of between 5 and 30 percent.

Analysis of linear relationships in block ciphers

This thesis is devoted to the study of linear relationships in symmetric block ciphers. A block cipher is designed so that the ciphertext is produced as a nonlinear function of the plaintext and secret master key. However, linear relationships within the cipher can still exist if the texts and components of the cipher are manipulated in a number of ways, as shown in this thesis. There are four main contributions of this thesis. The first contribution is the extension of the applicability of integral attacks from word-based to bitbased block ciphers. Integral attacks exploit the linear relationship between texts at intermediate stages of encryption. This relationship can be used to recover subkey bits in a key recovery attack. In principle, integral attacks can be applied to bit-based block ciphers. However, specific tools to define the attack on these ciphers are not available. This problem is addressed in this thesis by introducing a refined set of notations to describe the attack. The bit patternbased integral attack is successfully demonstrated on reduced-round variants of the block ciphers Noekeon, Present and Serpent. The second contribution is the discovery of a very small system of equations that describe the LEX-AES stream cipher. LEX-AES is based heavily on the 128-bit-key (16-byte) Advanced Encryption Standard (AES) block cipher. In one instance, the system contains 21 equations and 17 unknown bytes. This is very close to the upper limit for an exhaustive key search, which is 16 bytes. One only needs to acquire 36 bytes of keystream to generate the equations. Therefore, the security of this cipher depends on the difficulty of solving this small system of equations. The third contribution is the proposal of an alternative method to measure diffusion in the linear transformation of Substitution-Permutation-Network (SPN) block ciphers. Currently, the branch number is widely used for this purpose. It is useful for estimating the possible success of differential and linear attacks on a particular SPN cipher. However, the measure does not give information on the number of input bits that are left unchanged by the transformation when producing the output bits. The new measure introduced in this thesis is intended to complement the current branch number technique. The measure is based on fixed points and simple linear relationships between the input and output words of the linear transformation. The measure represents the average fraction of input words to a linear diffusion transformation that are not effectively changed by the transformation. This measure is applied to the block ciphers AES, ARIA, Serpent and Present. It is shown that except for Serpent, the linear transformations used in the block ciphers examined do not behave as expected for a random linear transformation. The fourth contribution is the identification of linear paths in the nonlinear round function of the SMS4 block cipher. The SMS4 block cipher is used as a standard in the Chinese Wireless LAN Wired Authentication and Privacy Infrastructure (WAPI) and hence, the round function should exhibit a high level of nonlinearity. However, the findings in this thesis on the existence of linear relationships show that this is not the case. It is shown that in some exceptional cases, the first four rounds of SMS4 are effectively linear. In these cases, the effective number of rounds for SMS4 is reduced by four, from 32 to 28. The findings raise questions about the security provided by SMS4, and might provide clues on the existence of a flaw in the design of the cipher.

Didiman: Australian agricultural extension officers in the territory of Papua and New Guinea, 1945-1975

Historically, the development philosophy for the two Territories of Papua and New Guinea (known as TPNG, formerly two territories, Papua and New Guinea) was equated with economic development, with a focus on agricultural development. To achieve the modification or complete change in indigenous farming systems the Australian Government’s Department of External Territories adopted and utilised a programme based on agricultural extension. Prior to World War II, under Australian administration, the economic development of these two territories, as in many colonies of the time, was based on the institution of the plantation. Little was initiated in agriculture development for indigenous people. This changed after World War II to a rationale based on the promotion and advancement of primary industry, but also came to include indigenous farmers. To develop agriculture within a colony it was thought that a modification to, or in some cases the complete transformation of, existing farming systems was necessary to improve the material welfare of the population. It was also seen to be a guarantee for the future national interest of the sovereign state after independence was granted. The Didiman and Didimisis became the frontline, field operatives of this theoretical model of development. This thesis examines the Didiman’s field operations, the structural organisation of agricultural administration and the application of policy in the two territories.

Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by a Caputo fractional derivative, and the second order space derivative by a symmetric fractional derivative. First, a method of separating variables expresses the analytical solution of the TSS-FDE in terms of the Mittag--Leffler function. Second, we propose two numerical methods to approximate the Caputo time fractional derivative: the finite difference method; and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by the Caputo fractional derivative and the second order space derivative by the symmetric fractional derivative. Firstly, a method of separating variables is used to express the analytical solution of the tss-fde in terms of the Mittag–Leffler function. Secondly, we propose two numerical methods to approximate the Caputo time fractional derivative, namely, the finite difference method and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results are presented to demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Response of tall buildings with symmetric setbacks under blast loading

This study explores three-dimensional nonlineardynamic responses of typical tall buildings with and without setbacks under blast loading. These 20 storey reinforced concrete buildings have been designed for normal (dead, live and wind)loads. The influence of the setbacks on the lateral load response due to blasts in terms of peak deflections, accelerations, inter-storey drift and bending moments at critical locations (including hinge formation) were investigated. Structural response predictions were performed with a commercially available three-dimensional finite element analysis programme using non-linear direct integration time history analyses. Results obtained for buildings with different setbacks were compared and conclusions made. The comparisons revealed that buildings have setbacks that protect the tower part above the setback level from blast loading show considerably better response in terms of peak displacement and interstorey drift, when compared to buildings without setbacks. Rotational accelerations were found to depend on the periods of the rotational modes. Abrupt changes in moments and shears are experienced near the levels of the setbacks. Typical twenty storey tall buildings with shear walls and frames that are designed for only normaln loads perform reasonably well, without catastrophic collapse, when subjected to a blast that is equivalent to 500 kg TNT at a standoff distance of 10 m.