doicomjnl bxr119 - Fields Point - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2011-12-03 09:51:22 Modular arithmetic Computer arithmetic Finite fields Binary operations Multiplication Residue number system Elliptic curve point multiplication Multiplication algorithm General-purpose computing on graphics processing units Montgomery modular multiplication XTR Division algorithm		doicomjnl/bxr119 Add to Reading List Source URL: www.inesc-id.pt Download Document from Source Website File Size: 731,82 KB Share Document on Facebook

	Fast point multiplication algorithms for binary elliptic curves with and without precomputation Thomaz Oliveira 1 Diego F. Aranha 2 Julio L´opez Francisco Rodr´ıguez-Henr´ıquez 1 1 DocID: 1qhyf - View Document
	doicomjnl/bxr119 DocID: 1oYqf - View Document
	Designs, Codes and Cryptography, 19, 195–c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. ° Efficient Arithmetic on Koblitz Curves* DocID: 18dFh - View Document
	Main text appears in A. H. Chan, V. Gligor (Eds.): Information Security – ISC 2002, Springer-Verlag LNCS 2433, pp. 402–413, ISBNNotes addedParallelizable Elliptic Curve Point Multiplicati DocID: 12Npk - View Document
	Individualizing Electrical Circuits of Cryptographic Devices as a Means to Hinder Tampering Attacks Zoya Dyka, Thomas Basmer, Christian Wittke and Peter Langendoerfer System dept., IHP Frankfurt(Oder), Germany DocID: 12Ibo - View Document