Download - ITB

More documents

Recommendations

Info

Finite Field Operations over the real numbers are slow andinaccurate due to round-off error Need to be faster and accurate Accurate and efficient : Prime field GF(p) Binary field GF(2 m ) Composite Field GF((2 m ) n )
COMPOSITE FIELD Using composite field, we may divide the computationinto subfields from GF(2 k ) into GF((2 n ) m ) where k =nm.1 2 3 4 5 6 7 8 9 … 2991234…1323
Page 1 and 2: Intan Muchtadi, Budi RahardjoMarisa
Page 3 and 4: Elliptic curvey 2 = x 3 − x
Page 5 and 6: Elliptic curve over F 23y 2 = x 3 +
Page 7 and 8: Multiples in Elliptic Curves 1 The
Page 9 and 10: Multiples in Elliptic Curves 2 Find
Page 11 and 12: Elliptic Curve Decryption INPUT : p
Page 13: POLLARD RHOLet , with , and and suc
Page 19 and 20: Multiplier for GF(2^13)[Paryasto-Ra
Page 21 and 22: ECC ARCHITECTURE WITHCOMPOSITE FIEL
Page 23 and 24: [Paryasto2012]
Page 25 and 26: Elliptic Curves over GF(2 n )Ellipt
Page 28 and 29: Experimental Results1 [Muchtadi-Ard
Page 30 and 31: Equivalence class (contd)
Page 32 and 33: Result with Frobenius-NegationThere
Page 34 and 35: Experimental Result 3, using Random
Page 36: Random Walk with new point
Page 39: Speeding the Squaring usingNormal B
Page 45: The use of Frobenius, Negationand N
Page 52: Implementation- for longer bit[Pary
Page 58 and 59: OUTPUT (1 proc intl conf, 3 jurnal
Page 60 and 61: OUTPUT (Tugas Akhir) M. Saputra, Al
Page 62 and 63: ACKNOWLEDGEMENT This research is fu
Page 64 and 65:
References [Muchtadi-Ardiansyah-Car
Page 66:
THANK YOU VERY MUCH FOR YOURATTENTI
show all

Download - ITB

Create successful ePaper yourself

Delete template?

Save as template?