A Multivariate Signature Based On Block Matrix Multiplication

An oil and vinegar scheme is a signature scheme based on multivariate quadratic polynomials over finite fields. The system of polynomials contains $n$ variables, divided into two groups: $v$ vinegar variables and $o$ oil variables. The scheme is called balanced (OV) or unbalanced (UOV), depending on whether $v = 0$ or not, respectively. These schemes are very fast and require modest computational resources, which make them ideal for low-cost devices such as smart cards. However, the OV scheme has been already proven to be insecure and the UOV scheme has been proven to be very vulnerable for many parameter choices. In this paper, we propose a new multivariate public key signature whose central map consists of a set of polynomials obtained from the multiplication of block matrices. Our construction is motivated by the design of the Simple Matrix Scheme for Encryption and the UOV scheme. We show that it is secure against the Separation Method, which can be used to attack the UOV scheme, and against the Rank Attack, which is one of the deadliest attacks against multivariate public-key cryptosystems. Some theoretical results on matrices with polynomial entries are also given, to support the construction of the scheme.

Hierarchially Distributed Data Matrix Scheme for Big Data Processing

MapReduce is a programming paradigm and an affiliated Design for processing and making substantial data sets. It operates on a large cluster of specialty machines and is extremely scalable Across the past years, MapReduce and Spark have been offered to facilitate the job of generating big data programs and utilization. However, the tasks in these structures are roughly described and packaged as executable jars externally any functionality being presented or represented. This means that extended roles are not natively composable and reusable for consequent improvement. Moreover, it also impedes the capacity for employing optimizations on the data stream of job orders and pipelines. In this article, we offer the Hierarchically Distributed Data Matrix (HDM), which is a practical, strongly-typed data description for writing composable big data appeals. Along with HDM, a runtime composition is presented to verify the performance of HDM applications on dispersed infrastructures. Based on the practical data dependency graph of HDM, various optimizations are employed to develop the appearance of performing HDM jobs. The empirical outcomes show that our optimizations can deliver increases of between 10% to 60% of the Job-Completion-Time for various types of applications when associated with the current state of the art, Apache Spark.

Horizontal Vibrations of Embedded Foundation in Multi-Layered Poroelastic Soils

In this paper, the dynamic response of rigid foundations of arbitrary shape embedded in multi-layered poroelastic soils subjected to time-harmonic horizontal loading is presented. The soil-structure interaction problem is investigated by employing a discretization technique and flexibility equations based on the influence functions obtained from an exact stiffness matrix scheme. The present solution scheme is verified with relevant existing solutions of rigid foundations on homogeneous elastic and poroelastic media. A selected set of numerical results are illustrated to portray the influence of various parameters, namely, frequency of excitation, poroelastic material parameters, foundation shapes, embedded depth, and the supporting soil systems, on non-dimensional horizontal compliances of rigid foundations.

An operational matrix for solving time-fractional order Cahn-Hilliard equation

In the present scientific work, an operational matrix scheme with Laguerre polynomials is applied to solve a space-time fractional order non-linear Cahn-Hilliard equation, which is used to calculate chemical potential and free energy for a non-homogeneous mixture. Constructing operational matrix for fractional differentiation, the collocation method is applied to convert Cahn-Hilliard equation into an algebraic system of equations, which have been solved using Newton method. The prominent features of the manuscript is to providing the stability analysis of the proposed scheme and the pictorial presentations of numerical solution of the concerned equation for different particular cases and showcasing of the effect of advection and reaction terms on the nature of solute concentration of the considered mathematical model for different particular cases.

Beamforming Networks for antenna array, useful inWiFi applications

In this paper several types of beamforming networks have been presented, this proposal can be used for an array antenna, which are used in several types of WiFi applications, IEEE 802.11b/g/draft-n. The first design corresponds to a 4x4 Butler Matrix for a resonance frequency at 2.45 GHz, depending on the port through which the signal is excited, it will be possible to obtain several variations in phase at the output ports (45°, 135°, -45° and -135°), the proposed Butler matrix has been optimized from a generalized matrix scheme, reducing the size through a simple overlap of multiple transmission lines to l/4 at the central frequency. The second design corresponds to a Rotman lens with a characteristic resonance frequency of 5.8 GHz, with a maximum focal angle of 30°, for this design has been used geometric optics concept, and the last design has been made for a frequency of 5.8 GHz using a slot array designed with Substrate Integrated Waveguide technology.