A Novel Methodology for Cloud of Things based Secure Higher Education Framework using Zero Knowledge Proof System

The cutting-edge technology, namely Cloud of Things (CoT) has shaped the existing business process into a new orientation in terms of performance, usability, and reliability. Among different business processes, online education is one of the prime areas where CoT can be used to make it more agile in the context of performance and usability. In this endeavor, a novel methodology has been proposed for an online higher education framework based on CoT. The proposed framework is made agile using Service Oriented Architecture (SOA). Furthermore, in order to make the proposed framework more reliable, a Zero Knowledge Proof (ZKPF) system has been introduced here. The proposed ZKPF algorithm is based on the Hadamard matrix. Experimental results have shown to lay bare the effectiveness of the proposed algorithms.

Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer

Finding a Hadamard matrix (H-matrix) among all possible binary matrices of corresponding order is a hard problem that can be solved by a quantum computer. Due to the limitation on the number of qubits and connections in current quantum processors, only low order H-matrix search of orders 2 and 4 were implementable by previous method. In this paper, we show that by adopting classical searching techniques of the H-matrices, we can formulate new quantum computing methods for finding higher order ones. We present some results of finding H-matrices of order up to more than one hundred and a prototypical experiment of the classical-quantum resource balancing method that yields a 92-order H-matrix previously found by Jet Propulsion Laboratory researchers in 1961 using a mainframe computer. Since the exactness of the solutions can be verified by an orthogonality test performed in polynomial time; which is untypical for optimization of hard problems, the proposed method can potentially be used for demonstrating practical quantum supremacy in the near future.

Enhanced Differential Evolution Algorithm with Local Search Based on Hadamard Matrix

Differential evolution (DE) is a robust algorithm of global optimization which has been used for solving many of the real-world applications since it was proposed. However, binomial crossover does not allow for a sufficiently effective search in local space. DE’s local search performance is therefore relatively poor. In particular, DE is applied to solve the complex optimization problem. In this case, inefficiency in local research seriously limits its overall performance. To overcome this disadvantage, this paper introduces a new local search scheme based on Hadamard matrix (HLS). The HLS improves the probability of finding the optimal solution through producing multiple offspring in the local space built by the target individual and its descendants. The HLS has been implemented in four classical DE algorithms and jDE, a variant of DE. The experiments are carried out on a set of widely used benchmark functions. For 20 benchmark problems, the four DE schemes using HLS have better results than the corresponding DE schemes, accounting for 80%, 75%, 65%, and 65% respectively. Also, the performance of jDE with HLS is better than that of jDE on 50% test problems. The experimental results and statistical analysis have revealed that HLS could effectively improve the overall performance of DE and jDE.

Matrix vitrages and regular Hadamard matrices

Introduction: The Kronecker product of Hadamard matrices when a matrix of order n replaces each element in another matrix of order m, inheriting the sign of the replaced element, is a basis for obtaining orthogonal matrices of order nm. The matrix insertion operation when not only signs but also structural elements (ornamental patterns of matrix portraits) are inherited provides a more general result called a "vitrage". Vitrages based on typical quasi-orthogonal Mersenne (M), Seidel (S) or Euler (E) matrices, in addition to inheriting the sign and pattern, inherit the value of elements other than unity (in amplitude) in a different way, causing the need to revise and systematize the accumulated experience. Purpose: To describe new algorithms for generalized product of matrices, highlighting the constructions that produce regular high-order Hadamard matrices. Results: We have proposed an algorithm for obtaining matrix vitrages by inserting Mersenne matrices into Seidel matrices, which makes it possible to expand the additive chains of matrices of the form M-E-M-E-… and S-E-M-E-…, obtained by doubling the orders and adding an edge. The operation of forming a matrix vitrage allows you to obtain matrices of high orders, keeping the ornamental pattern as an important invariant of the structure. We have shown that the formation of a matrix vitrage inherits the logic of the Scarpi product, but is cannot be reduced to it, since a nonzero distance in order between the multiplicands M and S simplifies the final regular matrix ornamental pattern due to the absence of cyclic displacements. The alternation of M and S matrices allows you to extend the multiplicative chains up to the known gaps in the S matrices. This sheds a new light on the theory of a regular Hadamard matrix as a product of Mersenne and Seidel matrices. Practical relevance: Orthogonal sequences with floating levels and efficient algorithms for finding regular Hadamard matrices with certain useful properties are of direct practical importance for the problems of noise-proof coding, compression and masking of video data.

Theoretical approaches to the synthesis of discrete signals with necessary properties

Methods for information exchange, formation and processing of data used in information and communication systems (ICS), as well as classes of broadband signals used as a physical data carrier, do not provide the necessary (for individual ICS applications) indicators of cyber and information security, noise immunity of reception signals and secrecy of IKS functioning. Most of the existing systems use signals, the construction of which is based on linear laws, which allows an attacker, based on the establishment of the parameters of the signals used in the system, to carry out deliberate interference in the operation of the ICS with minimal energy consumption. The article presents conceptual approaches to the construction of secure ICS, which determine the need to cover the entire spectrum of information transformations in the complex, and based on the synthesis of signal systems with improved ensemble, correlation, structural properties. A method is proposed for synthesizing discrete derivatives of signals based on nonlinear discrete complex cryptographic signals (CS) and orthogonal signals formed on the basis of the rows of the Hadamard matrix (initial signals),. Based on computer modeling and the performed calculations, it is shown that the derivative signals formed on the basis of cryptographic sequences and rows of the Hadamard matrix have improved properties compared to orthogonal and linear classes of signals. Approaches to the construction are stated and a general characteristic of the hardware-software complex for synthesis, analysis, study of properties, generation, processing of a number of studied signal classes is given. It is shown that the use of such signals will improve such indicators of the system functioning as information security, noise immunity of signal reception and secrecy of functioning.

Analysis of implementations of the Scarpi method for calculating high orders Hadamard matrices of symmetric structures

An analysis of three modifications of the Scarpi method is given in order to assess their applicability to calculating Hadamard matrices of high orders with structural symmetries. Descriptions of modifications are presented, the results of Hadamard matrix calculation are demonstrated, confirming the conclusion about the significance of the Balonin-Seberry modification. The computational experiment shows that there are no results refuting the existence of matrices symmetric structures calculated by the Balonin-Seberry modification.

Concatenative Complete Complementary Code Division Multiple Access and its Fast Transform based Implementation

Over multipath channels, \textit{complete complementary code division multiple access} (CC-CDMA) and \textit{convolutional spreading code division multiple access} (CS-CDMA) provide {\it inter-channel interference} (ICI) free transmission with an enhanced {\it spectral efficiency} (SE). However, the {\it convolutional spreading} (CS) operation of the systems is computationally complex and involves a high \textit{peak-to-average power ratio} (PAPR). Address such issues, we propose the \textit{concatenative complete complementary code division multiple access} (CCC-CDMA). Since the CCCCs can be generated from the rows of the Walsh-Hadamard or \textit{discrete Fourier transform} (DFT) matrices, the CS operation can be implemented using corresponding {\it fast transforms} (FTs) to reduce computational complexity. Simulation results shown that enlargement of {\it spreading factor} (SF) strengthens the robustness against clipping noise and the binary CCCC generated by Walsh-Hadamard matrix has excellent robustness against Doppler frequency shifts.