Elliptic-curve-based security processor for RFID

YK Lee, K Sakiyama, L Batina… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
RFID (Radio Frequency IDentification) tags need to include security functions, yet at the
same time their resources are extremely limited. Moreover, to provide privacy, authentication …

Accelerating the scalar multiplication on elliptic curve cryptosystems over prime fields

P Longa - Cryptology ePrint Archive, 2008 - eprint.iacr.org
Elliptic curve cryptography (ECC), independently introduced by Koblitz and Miller in the 80's,
has attracted increasing attention in recent years due to its shorter key length requirement in …

New composite operations and precomputation scheme for elliptic curve cryptosystems over prime fields

P Longa, A Miri - Public Key Cryptography–PKC 2008: 11th International …, 2008 - Springer
We present a new methodology to derive faster composite operations of the form dP+ Q,
where d is a small integer≥ 2, for generic ECC scalar multiplications over prime fields. In …

An ECDSA processor for RFID authentication

M Hutter, M Feldhofer, T Plos - … , RFIDSec 2010, Istanbul, Turkey, June 8-9 …, 2010 - Springer
In the last few years, a lot of research has been made to bring asymmetric cryptography on
low-cost RFID tags. Many of the proposed implementations include elliptic-curve based …

A cryptographic processor for low-resource devices: Canning ECDSA and AES like sardines

M Hutter, M Feldhofer, J Wolkerstorfer - IFIP International Workshop on …, 2011 - Springer
Abstract The Elliptic Curve Digital Signature Algorithm (ECDSA) and the Advanced
Encryption Standard (AES) are two of the most popular cryptographic algorithms used …

New formulae for efficient elliptic curve arithmetic

H Hisil, G Carter, E Dawson - … Conference on Cryptology in India, Chennai …, 2007 - Springer
This paper is on efficient implementation techniques of Elliptic Curve Cryptography. In
particular, we improve timings for Jacobi-quartic (3M+ 4S) and Hessian (7M+ 1S or 3M+ 6S) …

New multibase non-adjacent form scalar multiplication and its application to elliptic curve cryptosystems (extended version)

P Longa, A Miri - Cryptology ePrint Archive, 2008 - eprint.iacr.org
In this paper we present a new method for scalar multiplication that uses a generic multibase
representation to reduce the number of required operations. Further, a multibase NAF-like …

Elliptic curve cryptography on the WISP UHF RFID tag

C Pendl, M Pelnar, M Hutter - RFID. Security and Privacy: 7th International …, 2012 - Springer
Abstract The Wireless Identification and Sensing Platform (WISP) can be used to
demonstrate and evaluate new RFID applications. In this paper, we present practical results …

Error detection and fault tolerance in ECSM using input randomization

A Dominguez-Oviedo, MA Hasan - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
For some applications, elliptic curve cryptography (ECC) is an attractive choice because it
achieves the same level of security with a much smaller key size in comparison with other …

SPA resistant elliptic curve cryptosystem using addition chains

A Byrne, F Crowe, WP Marnane… - … Journal of High …, 2007 - inderscienceonline.com
There has been a lot of interest in recent years in the problems faced by cryptosystems due
to side channel attacks. Algorithms for elliptic curve point scalar multiplication such as the …