Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n )

Samos, Greece July 23-July 25

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ASAP.2005.57

2005 IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Lejla Batina Articles by Nele Mentens Articles by Bart Preneel Articles by Ingrid Verbauwhede

	ASCII Text	x
	Lejla Batina, Nele Mentens, Bart Preneel, Ingrid Verbauwhede, "Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n )," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 350-355, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005.

	BibTex	x
	@article{ 10.1109/ASAP.2005.57, author = {Lejla Batina and Nele Mentens and Bart Preneel and Ingrid Verbauwhede}, title = {Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n )}, journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on}, volume = {0}, year = {2005}, issn = {1063-6862}, pages = {350-355}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2005.57}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on TI - Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n ) SN - 1063-6862 SP350 EP355 A1 - Lejla Batina, A1 - Nele Mentens, A1 - Bart Preneel, A1 - Ingrid Verbauwhede, PY - 2005 KW - Multiplication in GF(2^n ) KW - Hardware implementation KW - Systolic array architecture KW - Elliptic Curve Cryptography (ECC) KW - Montgomery method for point multiplication VL - 0 JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on ER -

Lejla Batina, Katholieke Universiteit Leuven, ESAT/SCD-COSIC

Nele Mentens, Katholieke Universiteit Leuven, ESAT/SCD-COSIC

Bart Preneel, Katholieke Universiteit Leuven, ESAT/SCD-COSIC

Ingrid Verbauwhede, University of California, El. Engineering Dept. Los Angeles, CA 90095

This paper proposes efficient algorithms for Elliptic Curve Cryptography (ECC). As an example a compact and efficient FPGA architecture for ECC over finite fields of even characteristic is presented. The implementation is balanced in order to increase the security w.r.t. simple side-channel attacks.

Index Terms:

Multiplication in GF(2^n ), Hardware implementation, Systolic array architecture, Elliptic Curve Cryptography (ECC), Montgomery method for point multiplication

Citation:

Lejla Batina, Nele Mentens, Bart Preneel, Ingrid Verbauwhede, "Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n )," asap, pp.350-355, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.