• Publications
  • Influence
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considered only for arithmetic inExpand
  • 178
  • 25
  • PDF
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Key distribution in wireless sensor networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience andExpand
  • 232
  • 22
  • PDF
Implementing Pairings at the 192-bit Security Level
We implement asymmetric pairings derived from Kachisa-Schaefer-Scott (KSS), Barreto-Naehrig (BN), and Barreto-Lynn-Scott (BLS) elliptic curves at the 192-bit security level. Somewhat surprisingly, weExpand
  • 61
  • 8
  • PDF
Two is the fastest prime: lambda coordinates for binary elliptic curves
In this work, we present new arithmetic formulas for a projective version of the affine point representation $$(x,x+y/x),$$(x,x+y/x), for $$x\ne 0,$$x≠0, which leads to an efficient computation ofExpand
  • 42
  • 8
  • PDF
Efficient implementation of elliptic curve cryptography in wireless sensors
The deployment of cryptography in sensor networks is a challenging task, given the limited computational power and the resource-constrained nature of the sensoring devices. This paper presents theExpand
  • 55
  • 6
  • PDF
Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction
The availability of a new carry-less multiplication instruction in the latest Intel desktop processors significantly accelerates multiplication in binary fields and hence presents the opportunity forExpand
  • 44
  • 5
  • PDF
AoT: Authentication and Access Control for the Entire IoT Device Life-Cycle
The consumer electronics industry is witnessing a surge in Internet of Things (IoT) devices, ranging from mundane artifacts to complex biosensors connected across disparate networks. As the demandExpand
  • 45
  • 5
  • PDF
Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
The availability of a new carry-less multiplication instruction in the latest Intel desktop processors significantly accelerates multiplication in binary fields and hence presents the opportunity forExpand
  • 30
  • 5
  • PDF
TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes
After a few years of intense research, wireless sensor networks (WSNs) still demand new secure and cryptographic schemes. On the other hand, the advent of cryptography from pairings has enabled aExpand
  • 110
  • 4
  • PDF
A note on high-security general-purpose elliptic curves
In this note we describe some general-purpose, high-efficiency elliptic curves tailored for security levels beyond 2. For completeness, we also include legacy-level curves at standard securityExpand
  • 36
  • 4
  • PDF