We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20% more efficient tha...

It is technically feasible for mobile social software such as pairing or ‘matchmaking’ systems to introduce people to others and assist information exchange. However, little is known about the social structure of many mobile communities or why they would want such pairing systems. While engaged in other work determining requirements for a mobile travel assistant we saw a potentially useful appl...

We study single-flavour quark pairing (“self-pairing”) in colour-superconducting phases of quark matter, paying particular attention to the difference between scenarios where all three flavours undergo single-flavour pairing, and scenarios where two flavours pair with each other (“2SC” pairing) and the remaining flavour self-pairs. We perform our calculations in the mean field approximation usi...

Securely associating, or“pairing,”wireless devices via out-ofband communication channels is a well established approach. Unfortunately, this technique is prone to human errors that lead to security problems such as man-in-the-middle attacks. To address this problem by motivating users, a previous proposal suggested the use of computer games. Games can make the pairing process rewarding, thus po...

Pairing based cryptosystems can accomplish novel security applications such as ID based cryptosystems which have not been con structed e ciently without the pairing The processing speed of the pair ing based cryptosystems is relatively slow compared with the other con ventional public key cryptosystems However several e cient algorithms for computing the pairing have been proposed namely Duursm...

In the last decade, pairing-based cryptography has been one of the most intensively studied subjects in cryptography. Various optimization techniques have been developed to speed up the pairing computation. However, implementing a pairing-based cryptosystem in resource constrained devices has been less tried. Moreover, due to progress on solving the discrete logarithm problem (DLP), those imple...

The possibilities of pairing in two-dimensional boson-fermion mixtures are carefully analyzed. It is shown that the boson-induced attraction between two identical fermions dominates the pwave pairing at low density. For a given fermion density, the pairing gap becomes maximal at a certain optimal boson concentration. The conditions for observing pairing in current experiments are discussed. PAC...

Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we show how to compress pairing values, how to couple this technique with that of point compression, and how to benefit from the compressed representation to speed up exponentiations involving pairing values, as required i...

Abstract. This article surveys the known results (and not very well-known results) associated with Cantor’s pairing function and the Rosenberg-Strong pairing function, including their inverses, their generalizations to higher dimensions, and a discussion of a few of the advantages of the Rosenberg-Strong pairing function over Cantor’s pairing function in practical applications. In particular, a...

Recombination and pairing of homologous chromosomes are critical for bivalent formation in meiotic prophase. In many organisms, including yeast, mammals, and plants, pairing and recombination are intimately interconnected. The POOR HOMOLOGOUS SYNAPSIS1 (PHS1) gene acts in coordination of chromosome pairing and early recombination steps in plants, ensuring pairing fidelity and proper repair of m...