Fajar Yuliawan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this work we propose the use of composite field to implement finite field multiplication, which will be use in ECC implementation. We use 299-bit keylength and GF((2<sup>13</sup>)<sup>23</sup>) is used instead of GF(2<sup>299</sup>). Composite field multiplier can be implemented using conventional multiplication operation or using LUT (Look-Up Table). In(More)
—Huhnlein et al showed that for totally non-aximal imaginary quadratic orders, the discrete logarithm problem can be reduced to the discrete logarithm problem in some finite fields. In previous work we showed that for twisted anomalous elliptic curves, the logarithm problem can also be reduced to the logarithm problem in some finite fields. In this work we(More)
  • 1