4212 search results - page 9 / 843 » On Compressible Pairings and Their Computation |
CSEE
2004
Springer
14 years 24 days ago
2004
Springer
In a course environment, pairing a student with one partner for the entire semester is beneficial, but may not be optimal. The authors conducted a study in two undergraduate level...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
CSEE
2007
Springer
14 years 1 months ago
2007
Springer
An important problem faced by many Computer Science and Software Engineering programs is declining enrollment. In an effort to reverse that trend at Mississippi State University, ...
WAIFI
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...