4212 search results - page 9 / 843 » On Compressible Pairings and Their Computation |
101
Voted
CSEE
2004
Springer
15 years 5 months 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...
110
Voted
DCC
2007
IEEE
16 years 1 days 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 ...
108
Voted
CSEE
2007
Springer
15 years 6 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, ...
116
Voted
WAIFI
2010
Springer
15 years 5 months 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...
114
Voted
DCC
2011
IEEE
14 years 7 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...