7 search results - page 1 / 2 » Avoiding Full Extension Field Arithmetic in Pairing Computat... |
AFRICACRYPT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
WAIFI
2010
Springer
13 years 10 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...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
NOSSDAV
2010
Springer
13 years 8 months ago
2010
Springer
Subjective quality perception studies with human observers are essential for multimedia system design. Such studies are known to be expensive and difficult to administer. They req...