State of the art in ultra-low power public key cryptography for wireless sensor networks

Gaubatz, Gunnar; Kaps, Jens-Peter; Öztürk, Erdinç; Sunar, Berk

doi:10.1109/percomw.2005.76

Cited by 176 publications

(93 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The use of Rabin encryption in low-resource platforms has been investigated by Shamir [19], Gaubatz et al [6,7] and more recently by Oren and Feldhofer [14]. The approaches considered in these papers differ significantly from PASSERINE; Gaubatz et al do not consider randomized multiplication but only bit-serial multiplication.…”

Section: Previous Workmentioning

confidence: 99%

The PASSERINE Public Key Encryption and Authentication Mechanism

Saarinen

2012

Information Security Technology for Applications

View full text Add to dashboard Cite

Abstract. PASSERINE 1 is a lightweight public key encryption mechanism which is based on a hybrid, randomized variant of the Rabin public key encryption scheme. Its design is targeted for extremely low-resource applications such as wireless sensor networks, RFID tags, embedded systems, and smart cards. As is the case with the Rabin scheme, the security of PASSERINE can be shown to be equivalent to factoring the public modulus. On many low-resource implementation platforms PASSERINE offers smaller transmission latency, hardware and software footprint and better encryption speed when compared to RSA or Elliptic Curve Cryptography. This is mainly due to the fact that PASSERINE implementations can avoid expensive big integer arithmetic in favor of a fully parallelizable CRT randomized-square operation. In order to reduce latency and memory requirements, PASSERINE uses Naccache-Shamir randomized multiplication, which is implemented with a system of simultaneous congruences modulo small coprime numbers. The PASSERINE private key operation is of comparable computational complexity to the RSA private key operation. The private key operation is typically performed by a computationally superior recipient such as a base station.

show abstract

Section: Previous Workmentioning

confidence: 99%

The PASSERINE Public Key Encryption and Authentication Mechanism

Saarinen

2012

Information Security Technology for Applications

View full text Add to dashboard Cite

show abstract

“…Gaubatz et al [5] investigated ECC implementations for wireless sensor networks. The architecture of the ECC processor occupied an area of 18 720 gates and consumed less than 400 µW of power at 500 kHz.…”

Section: Related Workmentioning

confidence: 99%

Public-Key Cryptography on the Top of a Needle

Batina

Mentens

Sakiyama

et al. 2007

2007 IEEE International Symposium on Circuits and Systems

View full text Add to dashboard Cite

Abstract-This work describes the smallest known hardware implementation for Elliptic/Hyperelliptic Curve Cryptography (ECC/HECC). We propose two solutions for Publickey Cryptography (PKC), which are based on arithmetic on elliptic/hyperelliptic curves. One solution relies on ECC over binary fields F2n where n is a composite number of the form 2p (p is a prime) and another on HECC on curves of genus 2 over F2p . This implies the same arithmetic unit for both cases which supports arithmetic in a field F2p . Our best solution that still results in a feasible performance features less than 5 kgates with an average power consumption smaller than 10 µW . I. INTRODUCTIONThe field of embedded systems is growing at a rapid rate, as devices such as mobile phones, PDAs, smart cards and more recently RFID tags, sensor nodes and key immobilizers have become unavoidable in our everyday life. Hence, the distinguishing characteristics of embedded security can be divided into two categories: resource-limitation and physical accessibility. The former one specifies severe resource constraints on the security architecture in terms of memory, computational capacity, and energy for embedded devices. The most challenging tasks for embedded security are implementations of Public-key Cryptography (PKC).RFID tags are small wireless devices for pervasive computing. Despite their rigorous constraints featuring extremely low budget for power and die size they also give rise to serious security and privacy issues. Typical security services include authentication, key management and encryption. Although some experts are a priori giving up on public key solutions, assuming it being too expensive and too power hungry, there exists a line of research exploring the limits of compact public key implementations for low-cost applications such as RFIDs and sensor networks.In our previous work we investigated standardized low cost solutions for Elliptic Curve Cryptography (ECC) processors supporting security algorithms and protocols for RFID [1]. Namely, in standards it is mainly recommended to use ECC over a field F 2 p , where p is a prime. In this work we describe a new solution based on Hyperelliptic Curve Cryptography (HECC) and on ECC over composite fields. HECC has some advantages over ECC because of the possibility to work in a smaller field e.g. for HECC (in the case of genus 2 curves) one can work in the field F 2 n whilst obtaining the same level of security as for ECC over fields of bit-lengths that are twice as large. The same holds for ECC over composite fields. This property allows for more compact ALU than in the case of ECC.

show abstract

“…They tried to integrate the RSA and ECC into SSL handshake to provide mutual authentication. Gaubats et al have compared Rabin's scheme, NtruEncrypt, and ECC on a low power device in [5]. The results of experiments show that the ECC is more appropriate for WSNs than Rabin's scheme and NtruEncrypt.…”

Section: Related Workmentioning

confidence: 99%

A New Security Protocol Based on Elliptic Curve Cryptosystems for Securing Wireless Sensor Networks

Seo

Kim

Ramakrishna

2006

Emerging Directions in Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

Abstract. In this paper, we describe the design and implementation of a new security protocol based on Elliptic Curve Cryptosystems (ECC) for securing Wireless Sensor Networks (WSNs). Some public-key-based protocols such as TinyPK and EccM 2.0 have already been proposed in response. However, they exhibit poor performance. Moreover, they are vulnerable to man-in-the-middle attacks. We propose a cluster-based Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA) for efficiency and security during the pairwise key setup and broadcast authentication phases, respectively. We have implemented our protocol on 8-bit, 7.3828-MHz MICAz mote. The experimental results indicate the feasibility of our protocol for WSNs.

show abstract

State of the art in ultra-low power public key cryptography for wireless sensor networks

Cited by 176 publications

References 3 publications

The PASSERINE Public Key Encryption and Authentication Mechanism

The PASSERINE Public Key Encryption and Authentication Mechanism

Public-Key Cryptography on the Top of a Needle

A New Security Protocol Based on Elliptic Curve Cryptosystems for Securing Wireless Sensor Networks

Contact Info

Product

Resources

About