Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"bilinear map"”.
-
Asymptotic enumeration of matrix groups
… To count these subgroups, we use nuclei of a bilinear map alongside versor products - a division analog of the tensor product.
-
Topological and combinatoric methods for studying sums of squares
… squares formulae from the perspective of normed bilinear maps and their Hopf constructions. We begin with the geometric properties of quadratic forms between euclidean spheres. Let F: Sm → Sn be a quadratic form. For every point q in the image, the inverse image F⁻¹ (q) is the intersection of Sm …
-
The tensor product of two abelian groups
… h : A⊗B→H is assured by the existence of a bilinear map f : A×B→H , where H is any group (Lemma 2-2) and this property of the tensor product is used extensively throughout the thesis. In Chapter 3 the complete characterization is given for the tensor product of two arbitrary finitely …
-
FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field
… sacrificing security level. Tate pairing is a bilinear map used in identity based cryptography schemes. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. Similarly, Tate pairing is also quite computationally expensive. …
-
Borcherds-Kac-Moody algebras and BPS states in heterotic compactifications
… strings. In 1996, Harvey and Moore introduced a bilinear map on BPS states. For heterotic compactifications, they found the resulting structure to be a Borcherds–Kac–Moody algebra.<br><br>In this thesis, Borcherds–Kac–Moody algebras are shown to possess structures similar to a Killing form and a …
-
A Partial Nonlinear Extension of Lax-Richtmyer Approximation Theory
… algorithms from being linear is itself a bilinear map. When the algorithms satisfy consistency with a PDE initial value problem we obtain the definition of a new kind of numerical solution and their existence [Theorem 6] given said algorithms.
-
Growth of Bilinear Maps
… of the joint spectral radius. Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, both with nonnegative coefficients and entries, among an exponential number of ways to combine $n$ instances of $s$ using $n-1$ applications of $*$, we are …
-
Number Theoretic Algorithms For Elliptic Curves
… curve E over any field K, the Weil pairing is a bilinear map on the points of order n of E. The Weil pairing is a useful tool in both the theory of elliptic curves and the application of elliptic curves to cryptography. However, for K of characteristic p, the classical Weil pairing on the points …
-
Applications of Bilinear Maps in Cryptography
… [30] and Sakai, Ohgishi and Kasahara [47] that bilinear maps could be used to construct cryptographic schemes. Since then, bilinear maps have been used in applications as varied as identity-based encryption, short signatures and one-round tripartite key agreement. This thesis explains the notion …
-
VECTOR INTEGRALS AND PRODUCTS OF VECTOR MEASURES
… (X,Y;Z) of LCTVS's together with a continuous bilinear mapping from X x Y into Z (called a bilinear system of LCTVS's), a measurable space (T, ) and a measure (beta): (--->) Y. For each continuous semi-norm r on Z and each bounded subset B of X, we define a semi-variation …