Download - ITB

More documents

Recommendations

Info

References [Muchtadi-Ardiansyah-Carita2013b] ] I.Muchtadi-Alamsyah, T.Ardiansyah,S.S.Carita, Pollard Rho Algorithm for Elliptic Curves over GF(2 n ) with RandomWalk, Frobenius Map and Normal Basis, submitted to Journal of Software. [Paryasto2012] M.W. Paryasto, Arsitektur Unit Pengali Composite FieldKombinasi MH-KOA untuk Elliptic Curve Cryptography, Disertasi Doktor <strong>ITB</strong>,2012. [Paryasto-Rahardjo2013] M.Paryasto, B. Rahardjo, Implementation ofPolynomial Basis Squaring, draft. [Paryasto-Rahardjo-Muchtadi-Kuspriyanto2010] M. W.Paryasto, B.Rahardjo, I.Muchtadi-Alamsyah, Kuspriyanto, Rancangan Unit Aritmetika Finite FieldBerbasis Composite Field, Prosiding MUNAS Aptikom 2010, pp. 98-102
REFERENCES [Paryasto-Rahardjo-Muchtadi-Kuspriyanto2011] M. W.Paryasto,B.Rahardjo, I. Muchtadi-Alamsyah and Kuspriyanto, ImplementasiComposite Field pada Elliptic Curve Cryptography, Jurnal Ilmiah IlmuKomputer Vol.7 No.2 Maret 2011 [Paryasto-Rahardjo-Yuliawan-Muchtadi-Kuspriyanto2012] M. W.Paryasto, B.Rahardjo, F. Yuliawan, I.Muchtadi-Alamsyah andKuspriyanto, Composite Field Multiplier Based on Look-up Table forElliptic Curve Cryptography Implementation, <strong>ITB</strong> Journal ofInformation and Communication Technology Vol 6 no 1 (2012) 63-81
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 17 and 18: COMPOSITE FIELD Using composite fie
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 66: THANK YOU VERY MUCH FOR YOURATTENTI
show all

Download - ITB

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?