No description available.

Let A be an m x n, (0, 1)-matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2 x 2 odd submatrices in a (0, 1)-matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal number of even submatrices of 0-1 matrices, Designs, Codes and Cryptography, 9:85-93, 1994] exhibits an asymptotic formula for the minimum possible number of p x q even submatrices of an m x n (0, 1)-matrix. Assuming the Hadamard conjecture, specific techniques are provided on how to assign the 0's and 1's, in order to yield the maximum number of 2 x 2 odd submatrices in an m x n (0, 1)-matrix. Moreover, formulas are determined that yield the exact maximum counts with one exception, in which case upper and lower bounds are given. These results extend and refine those of Pinelis.

Boolean functions are the main building blocks of most cipher systems. Various aspects of their cryptological characteristics are examined and investigated by many researchers from different fields. This thesis has no claim to obtain original results but consists in an attempt at giving a unified survey of the main results of the subject. In this thesis, the theory of boolean functions is presented in details, emphasizing some important cryptological properties such as balance, nonlinearity, strict avalanche criterion and propagation criterion. After presenting many results about these criteria with detailed proofs, two upper bounds and two lower bounds on the nonlinearity of a boolean function due to Zhang and Zheng are proved. Because of their importance in the theory of boolean functions, construction of Sylvester-Hadamard matrices are shown and most of their properties used in cryptography are proved. The Walsh transform is investigated in detail by proving many properties. By using a property of Sylvester-Hadamard matrices, the fast Walsh transform is presented and its application in finding the nonlinearity of a boolean function is demonstrated. One of the most important classes of boolean functions, so called bent functions, are presented with many properties and by giving several examples, from the paper of Rothaus. By using bent functions, relations between balance, nonlinearity and propagation criterion are presented and it is shown that not all these criteria can be simultaneously satisfied completely. For this reason, several constructions of functions optimizing these criteria which are due to Seberry, Zhang and Zheng are presented.

Boolean functions are accepted to be cryptographically strong if they satisfy some common pre-determined criteria. It is expected that any design criteria should remain invariant under a large group of transformations due to the theory of similarity of secrecy systems proposed by Shannon. One of the most important design criteria for cryptographically strong Boolean functions is the nonlinearity criterion. Meier and Staffelbach studied nonlinearity preserving transformations, by considering the invertible transformations acting on the arguments of Boolean functions, namely the pre-transformations. In this thesis, first, the results obtained by Meier and Staffelbach are presented. Then, the invertible transformations acting on the truth tables of Boolean functions, namely the post-transformations, are studied in order to determine whether they keep the nonlinearity criterion invariant. The equivalent counterparts of Meier and Staffelbach&rsquo / s results are obtained in terms of the post-transformations. In addition, the existence of nonlinearity preserving post-transformations, which are not equivalent to pre-transformations, is proved. The necessary and sufficient conditions for an affine post-transformation to preserve nonlinearity are proposed and proved. Moreover, the sufficient conditions for an non-affine post-transformation to keep nonlinearity invariant are proposed. Furthermore, it is proved that the smart hill climbing method, which is introduced to improve nonlinearity of Boolean functions by Millan et. al., is equivalent to applying a post-transformation to a single Boolean function. Finally, the necessary and sufficient condition for an affine pre-transformation to preserve the strict avalanche criterion is proposed and proved.

Thesis (M.S.)--Naval Postgraduate School (Monterey, Calif.), 1991. / Cover title. "September, 1991." Includes bibliographical references (leaves 123-125).

Consider an m x zero-one matrix A. An s x t submatrix of A is said to be even if the sum of its entries is even. In this paper, we focus on the case m = n and s = t = 2. The maximum number M(n) of even 2 x 2 submatrices of A is clearly ( 2n) 2, and corresponds to the matrix A having, e.g., all ones (or zeros). A more interesting question, motivated by Turán numbers and Hadamard matrices, is that of the minimum number m(n) of such matrices. It has recently been shown that m(n) ≥ 1/2 ( 2n) 2 - Bn 3 for some constant B. In this paper we show that if the matrix A = A n is considered to be induced by an infinite zero one matrix obtained at random, then P(E n ≤1/2( 2n) 2 - Cn 2 log n infinitely often) = 0, where E n denotes the number of even 2 x 2 submatrices of A n. Results such as these provide us with specific information about the tightness of the concentration of E n around its expected value of 1/2 ( 2n) 2.

In recent years, chemical instrumentation has become much more sophisticated. Most analytical equipment now incorporates a microprocessor or is interfaced to a microcomputer. As a result, chemists can collect an immense amount of data on a single sample in a short period of time. While there may be an advantage to gathering such a great deal of information, problems can arise from too much information. Today, analysts commonly are faced with the dual problems of storing and analyzing the resulting flood of information. The goal of this research has been to address the problems of data storage and data analysis. Specifically, data compression techniques and spectral search and match algorithms have been developed. The data compression techniques developed utilize the Hadamard Transform and the modified zero-crossing clipping algorithm. The spectral search technique utilizes the unique format of the compressed and clipped data to greatly accelerate spectrum identification. To demonstrate the feasibility of this technique, three-dimensional fluorescence spectra of polynuclear aromatic compounds have been used. The results indicate data compression techniques and the application of these techniques to a library search system for three-dimensional fluorescence spectroscopy were both successful. / Ph. D.