A family of implementation-friendly BN elliptic curves

For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it provides with relatively small keys and to its ability to create very efficient and multifunctional cryptographic schemes by means of bilinear pairings. Pairings require pairing-friendly elliptic curves and among the possible choices, Barreto-Naehrig (BN) curves arguably constitute one of the most versatile families. In this paper, we further expand the potential of the BN curve family. We describe BN curves that are not only computationally very simple to generate, but also specially suitable for efficient implementation on a very broad range of scenarios. We also present implementation results of the optimal ate pairing using such a curve defined over a 254-bit prime field. (C) 2001 Elsevier Inc. All rights reserved.

Java Cryptographic Library for Smartphones

A JME-compliant cryptographic library for mobile application development is introduced in this paper. The library allows cryptographic protocols implementation over elliptic curves with different security levels and offers symmetric and asymmetric bilinear pairings operations, as Tate, Weil, and Ate pairings.

Hardware processors for pairing-based cryptography

Bilinear pairings can be used to construct cryptographic systems with very desirable properties. A pairing performs a mapping on members of groups on elliptic and genus 2 hyperelliptic curves to an extension of the finite field on which the curves are defined. The finite fields must, however, be large to ensure adequate security. The complicated group structure of the curves and the expensive field operations result in time consuming computations that are an impediment to the practicality of pairing-based systems. The Tate pairing can be computed efficiently using the ɳT method. Hardware architectures can be used to accelerate the required operations by exploiting the parallelism inherent to the algorithmic and finite field calculations. The Tate pairing can be performed on elliptic curves of characteristic 2 and 3 and on genus 2 hyperelliptic curves of characteristic 2. Curve selection is dependent on several factors including desired computational speed, the area constraints of the target device and the required security level. In this thesis, custom hardware processors for the acceleration of the Tate pairing are presented and implemented on an FPGA. The underlying hardware architectures are designed with care to exploit available parallelism while ensuring resource efficiency. The characteristic 2 elliptic curve processor contains novel units that return a pairing result in a very low number of clock cycles. Despite the more complicated computational algorithm, the speed of the genus 2 processor is comparable. Pairing computation on each of these curves can be appealing in applications with various attributes. A flexible processor that can perform pairing computation on elliptic curves of characteristic 2 and 3 has also been designed. An integrated hardware/software design and verification environment has been developed. This system automates the procedures required for robust processor creation and enables the rapid provision of solutions for a wide range of cryptographic applications.

CERN LHC signals for a neutrino mass model with bilinear R-parity violating minimal anomaly mediated supersymmetry

We investigate a neutrino mass model in which the neutrino data is accounted for by bilinear R-parity violating supersymmetry with anomaly mediated supersymmetry breaking. We focus on the CERN Large Hadron Collider (LHC) phenomenology, studying the reach of generic supersymmetry search channels with leptons, missing energy and jets. A special feature of this model is the existence of long-lived neutralinos and charginos which decay inside the detector leading to detached vertices. We demonstrate that the largest reach is obtained in the displaced vertices channel and that practically all of the reasonable parameter space will be covered with an integrated luminosity of 10 fb(-1). We also compare the displaced vertex reaches of the LHC and Tevatron.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Bilinear H 2-optimal Model Order-Reduction with applications to thermal parametric systems

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Bilinear models for spatio-temporal point distribution analysis: application to extrapolation of left ventricular, biventricular and whole heart cardiac dynamics

In this work we describe the usage of bilinear statistical models as a means of factoring the shape variability into two components attributed to inter-subject variation and to the intrinsic dynamics of the human heart. We show that it is feasible to reconstruct the shape of the heart at discrete points in the cardiac cycle. Provided we are given a small number of shape instances representing the same heart atdifferent points in the same cycle, we can use the bilinearmodel to establish this. Using a temporal and a spatial alignment step in the preprocessing of the shapes, around half of the reconstruction errors were on the order of the axial image resolution of 2 mm, and over 90% was within 3.5 mm. From this, weconclude that the dynamics were indeed separated from theinter-subject variability in our dataset.

Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powers

In this paper we present error analysis for a Monte Carlo algorithm for evaluating bilinear forms of matrix powers. An almost Optimal Monte Carlo (MAO) algorithm for solving this problem is formulated. Results for the structure of the probability error are presented and the construction of robust and interpolation Monte Carlo algorithms are discussed. Results are presented comparing the performance of the Monte Carlo algorithm with that of a corresponding deterministic algorithm. The two algorithms are tested on a well balanced matrix and then the effects of perturbing this matrix, by small and large amounts, is studied.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

Probing bilinear R-parity violating supergravity at the LHC

We study the collider phenomenology of bilinear R-parity violating supergravity, the simplest effective model for supersymmetric neutrino masses accounting for the current neutrino oscillation data. At the CERN Large Hadron Collider the center-of-mass energy will be high enough to probe directly these models through the search for the superpartners of the Standard Model (SM) particles. We analyze the impact of R-parity violation on the canonical supersymmetry searches-that is, we examine how the decay of the lightest supersymmetric particle (LSP) via bilinear R-parity violating interactions degrades the average expected missing momentum of the reactions and show how this diminishes the reach in the usual channels for supersymmetry searches. However, the R-parity violating interactions lead to an enhancement of the final states containing isolated same-sign di-leptons and trileptons, compensating the reach loss in the fully inclusive channel. We show how the searches for displaced vertices associated to LSP decay substantially increase the coverage in supergravity parameter space, giving the corresponding reaches for two reference luminosities of 10 and 100 fb(-1) and compare with those of the R-parity conserving minimal supergravity model.

Tridiagonal canonical matrices of bilinear or sesquilinear forms and of pairs of symmetric, skew-symmetric, or Hermitian forms

Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field of characteristic different from 2. (C) 2008 Elsevier Inc. All rights reserved.

Controle preditivo bilinear aplicado a um motor de indução

The present work is based on the applied bilinear predictive control applied to an induction motor. As in particular case of the technique based on predictive control in nonlinem systems, these have desperted great interest, a time that present the advantage of being simpler than the non linear in general and most representative one than the linear one. One of the methods, adopted here, uses the linear model "quasi linear for step of time" based in Generalized Predictive Control. The modeling of the induction motor is made by the Vectorial control with orientation given for the indirect rotor. The system is formed by an induction motor of 3 cv with rotor in squirregate, set in motion for a group of benches of tests developed for this work, presented resulted for a variation of +5% in the value of set-point and for a variation of +10% and -10% in the value of the applied nominal load to the motor. The results prove a good efficiency of the predictive bilinear controllers, then compared with the linear cases

Estudo e implementação de um controlador preditivo generalizado bilinear compensado adaptativo

The present work presents the study and implementation of an adaptive bilinear compensated generalized predictive controller. This work uses conventional techniques of predictive control and includes techniques of adaptive control for better results. In order to solve control problems frequently found in the chemical industry, bilinear models are considered to represent the dynamics of the studied systems. Bilinear models are simpler than general nonlinear model, however it can to represent the intrinsic not-linearities of industrial processes. The linearization of the model, by the approach to time step quasilinear , is used to allow the application of the equations of the generalized predictive controller (GPC). Such linearization, however, generates an error of prediction, which is minimized through a compensation term. The term in study is implemented in an adaptive form, due to the nonlinear relationship between the input signal and the prediction error.Simulation results show the efficiency of adaptive predictive bilinear controller in comparison with the conventional.

Efeito Kerr magneto-óptico; Ressonância ferromagnética; Acoplamento bilinear; Acoplamento biquadrático

In this work, we investigated the magnetic properties of a monocrystalline Fe thin film and of Fe(80 Å)/Cr(t)/Fe(80 Å) tri-layers, with the nonmagnetic metallic Cr spacer layer thickness varying between 9 Å < t < 40 Å. The samples were deposited by the DC Sputtering on Magnesium Oxide (MgO) substrates, with (100) crystal orientation. For this investigation, experimental magneto-optical Kerr effect (MOKE) magnetometry and ferromagnetic resonance (FMR) techniques were employeed. In this case, these techniques allowed us to study the static and dynamical magnetization properties of our tri-layers. The experimental results were interpreted based on the phenomenological model that takes into account the relevant energy terms to the magnetic free energy to describe the system behavior. In the case of the monocrystalline Fe film, we performed an analytical discussion on the magnetization curves and developed a numerical simulation based on the Stoner-Wohlfarth model, that enables the numerical adjustment of the experimental magnetization curves and obtainment of the anisotropy field values. On the other hand, for the tri-layers, we analyzed the existence of bilinear and biquadratic couplings between the magnetizations of adjacent ferromagnetic layers from measurements of magnetization curves. With the FMR fields and line width angular dependencies, information on the anisotropy in three layers was obtained and the effects of different magnetic relaxation mechanisms were evidenced. It was also possible to observe the dependence of the epitaxy of the multilayers with growth and sputtering parameters. Additionally it was developed the technique of AC magnetic susceptibility in order to obtain further information during the investigation of magnetic thin films

Probing bilinear R-parity violating supergravity at the LHC

We study the collider phenomenology of bilinear R-parity violating supergravity, the simplest effective model for supersymmetric neutrino masses accounting for the current neutrino oscillation data. At the CERN Large Hadron Collider the center-of-mass energy will be high enough to probe directly these models through the search for the superpartners of the Standard Model (SM) particles. We analyze the impact of R-parity violation on the canonical supersymmetry searches-that is, we examine how the decay of the lightest supersymmetric particle (LSP) via bilinear R-parity violating interactions degrades the average expected missing momentum of the reactions and show how this diminishes the reach in the usual channels for supersymmetry searches. However, the R-parity violating interactions lead to an enhancement of the final states containing isolated same-sign di-leptons and trileptons, compensating the reach loss in the fully inclusive channel. We show how the searches for displaced vertices associated to LSP decay substantially increase the coverage in supergravity parameter space, giving the corresponding reaches for two reference luminosities of 10 and 100 fb(-1) and compare with those of the R-parity conserving minimal supergravity model.