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 20 of 768 for “"pairings"”.
-
Optimal Pairings on BN Curves
Bilinear pairings are being used in ingenious ways to solve various protocol problems. Much research has been done on improving the efficiency of pairing computations. This thesis gives an introduction to the Tate pairing and some variants including the ate pairing, Vercauteren's pairing, and the …
-
Efficient Pairings on Various Platforms
Pairings have found a range of applications in many areas of cryptography. As such, to utilize the enormous potential of pairing-based protocols one needs to efficiently compute pairings across various computing platforms. In this thesis, we give an introduction to pairing-based cryptography and …
-
Height Pairings of 1-Motives
Lo scopo di questo lavoro è la generalizzazione, nel contesto degli 1-motivi, degli accoppiamenti di altezza costruiti da B. Mazur e J. Tate sulle varietà abeliane. Seguendo il loro approccio, consideriamo ρ-splittings della biestensione di Poincaré di un 1-motivo e richiediamo che siano …
-
Cryptographic Pairings: Efficiency and DLP security
… studies two important aspects of the use of pairings in cryptography, efficient algorithms and security. Pairings are very useful tools in cryptography, originally used for the cryptanalysis of elliptic curve cryptography, they are now used in key exchange protocols, signature schemes and …
-
Group key agreement from bilinear pairings
The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current …
-
Graphs and pairings of elliptic curves
… curves is known? Does the existence of suitable pairings affect the hardness of l-IsoPath? What happens if some non-trivial endomorphisms of the domain and codomain curves are known? These kinds of questions lead to different problems, some of which are considered throughout this thesis. To …
-
Invariant bilinear differential pairings on parabolic geometries.
… the theory of invariant bilinear differential pairings on parabolic geometries. It introduces the concept formally with the help of the jet bundle formalism and provides a detailed analysis. More precisely, after introducing the most important notations and definitions, we first of all give an …
-
Pairings in Cryptology: efficiency, security and applications
Abstract The study of pairings can be considered in so many di�erent ways that it may not be useless to state in a few words the plan which has been adopted, and the chief objects at which it has aimed. This is not an attempt to write the whole history of the pairings in cryptology, or to detail …
-
On the Efficiency and Security of Cryptographic Pairings
… thesis, we explore the efficient computation of pairings. Computation of the Tate pairing is done in two steps. First, a Miller function is computed, followed by the final exponentiation. We discuss the state-of-the-art optimizations for Miller function computation under various conditions. We …
-
Peculiar Pairings: Texas Confederates and Their Body Servants
Peculiar Pairings: Texas Confederates and their Body Servants is an examination of the relationship between Texas Confederates and the slaves they brought with them during and after the American Civil War. The five chapter study seeks to make sense of the complex relationships shared by some …
-
Triviality and Nontriviality of Tate-Lichtenbaum Self Pairings
… when all points in E[n] have trivial self pairings. This result is expressed in terms of the action of the Frobenius endomorphism on E[n^2]. We then generalize this result to Jacobians of algebraic curves of arbitrary genus.
-
The impact of incongruent vs. congruent food brand pairings
… smoothie). The findings suggest that congruent pairings lead to better positive brand attitudes and positive word-of-mouth towards the combined brand and that incongruent pairings incur more pass-along on social media.
-
Pairings: Quintets and Duos from the Collaborative Piano Repertoire
Chamber music with piano comprises some of the greatest masterpieces in the Western canon. The works range from duo sonatas with various instruments through septets. In regard to duo sonatas, the violin is the instrument most frequently paired with the piano. Of all the chamber works for larger …
-
Secure cryptographic protocols and applications based on bilinear pairings
Bilinear pairings over elliptic curve groups constitute a very promising primitive for the construction of novel assymetric encryption systems where any string that undeniably identities a user or an attribute can work as a public key. This property enables the creation of public keys on the …
-
Volume Formula and Intersection Pairings of N-fold Reduced Products
… the symplectic volume and the intersection pairings of an N-fold reduced product of G. In 2008, Suzuki and Takakura gave a volume formula of N-fold reduced products of SU(3) via Riemann-Roch. We compare our volume formula with theirs and prove that our volume formula matches theirs in the …
-
Cryptographic Key Distribution In Wireless Sensor Networks Using Bilinear Pairings
… the newest achievements in cryptography like pairings and IBC it is possible to deliver affordable public-key cryptographic solutions and to apply a sufficient level of security for the most demanding WSN applications.
-
Pairings in a Ring Spectrum-Based Bousfield-Kan Spectral Sequence
… by a similar construction to the original. Pairings can be established on these spectral sequences, and, for nice enough spaces, these pairings on the E2-terms coincide with certain pairings on Ext groups.
-
Applications of Circulations and Removable Pairings to TSP and 2ECSS
In this thesis we focus on two NP-hard and intensively studied problems: The travelling salesman problem (TSP), which aims to find a minimum cost tour that visits every node exactly once in a complete weighted graph, and the 2-edge-connected spanning subgraph problem (2ECSS), which aims to find a …
Page 1 of 39