TY  - 
  - Other
  - Kerins, T,Marnane, WP,Popovici, EM,Barreto, PSLM
  - 2005
  - May
  - Efficient hardware for the Tate pairing calculation in characteristic three
  - Validated
  - 1
  - ()
  - Tate pairing hardware accelerator characteristic three tower fields ALGORITHMS IMPLEMENTATION CRYPTOSYSTEMS ARCHITECTURES CURVES
  - In this paper the benefits of implementation of the Tate pairing computation on dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF(3(6m)) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field CF(3(m)). Using this approach, an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.
  - 412
  - 426
DA  - 2005/05
ER  - 

@misc{V160959947,
   = {Other},
   = {Kerins,  T and Marnane,  WP and Popovici,  EM and Barreto,  PSLM },
   = {2005},
   = {May},
   = {Efficient hardware for the Tate pairing calculation in characteristic three},
   = {Validated},
   = {1},
   = {()},
   = {Tate pairing hardware accelerator characteristic three tower fields ALGORITHMS IMPLEMENTATION CRYPTOSYSTEMS ARCHITECTURES CURVES},
   = {{In this paper the benefits of implementation of the Tate pairing computation on dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF(3(6m)) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field CF(3(m)). Using this approach, an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.}},
  pages = {412--426},
  source = {IRIS}
}