TY  - 
  - Other
  - Daly, A,Marnane, W,Kerins, T,Popovici, E
  - 2003
  - March
  - Fast modular division for application in ECC on reconfigurable logic
  - Validated
  - 1
  - ()
  - MONTGOMERY INVERSE CRYPTOGRAPHY GF(2(N))
  - Elliptic Curve Public Key Cryptosystems are becoming increasingly popular for use in mobile devices and applications where bandwidth and chip area are limited. They provide much higher levels of security per key length than established public key systems such as RSA. The underlying operation of elliptic curve point multiplication requires modular multiplication, division/inversion and addition/subtraction. Division is by far the most costly operation in terms of speed. This paper proposes a new divider architecture and implementation on FPGA for use in an ECC processor.
  - 786
  - 795
DA  - 2003/03
ER  - 

@misc{V160960519,
   = {Other},
   = {Daly,  A and Marnane,  W and Kerins,  T and Popovici,  E },
   = {2003},
   = {March},
   = {Fast modular division for application in ECC on reconfigurable logic},
   = {Validated},
   = {1},
   = {()},
   = {MONTGOMERY INVERSE CRYPTOGRAPHY GF(2(N))},
   = {{Elliptic Curve Public Key Cryptosystems are becoming increasingly popular for use in mobile devices and applications where bandwidth and chip area are limited. They provide much higher levels of security per key length than established public key systems such as RSA. The underlying operation of elliptic curve point multiplication requires modular multiplication, division/inversion and addition/subtraction. Division is by far the most costly operation in terms of speed. This paper proposes a new divider architecture and implementation on FPGA for use in an ECC processor.}},
  pages = {786--795},
  source = {IRIS}
}