Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Faster Explicit Formulas for Computing Pairings over Ordinary Curves

- D. Aranha, Koray Karabina, P. Longa, C. Gebotys, J. C. López-Hernández
- Computer Science, Mathematics
- EUROCRYPT
- 15 May 2011

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 in… Expand

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

- Leonardo B. Oliveira, D. Aranha, +4 authors R. Dahab
- Computer Science
- 5th International Conference on Networked Sensing…
- 1 March 2011

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 and… Expand

Implementing Pairings at the 192-bit Security Level

- D. Aranha, Laura Fuentes-Castañeda, E. Knapp, A. Menezes, F. Rodríguez-Henríquez
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 16 May 2012

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, we… Expand

Two is the fastest prime: lambda coordinates for binary elliptic curves

- Thomaz Oliveira, J. C. López-Hernández, D. Aranha, F. Rodríguez-Henríquez
- Computer Science, Mathematics
- Journal of Cryptographic Engineering
- 28 January 2014

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 of… Expand

Efficient implementation of elliptic curve cryptography in wireless sensors

- D. Aranha, R. Dahab, J. Hernandez, Leonardo B. Oliveira
- Computer Science, Mathematics
- Adv. Math. Commun.
- 1 May 2010

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 the… Expand

Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction

- J. Taverne, Armando Faz-Hernández, D. Aranha, F. Rodríguez-Henríquez, D. Hankerson, J. C. López-Hernández
- Mathematics, Computer Science
- Journal of Cryptographic Engineering
- 25 September 2011

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 for… Expand

AoT: Authentication and Access Control for the Entire IoT Device Life-Cycle

- Antonio L. Maia Neto, Artur L. F. Souza, +8 authors Leonardo B. Oliveira
- Computer Science
- SenSys
- 14 November 2016

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 demand… Expand

Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication

- J. Taverne, Armando Faz-Hernández, D. Aranha, F. Rodríguez-Henríquez, D. Hankerson, J. C. López-Hernández
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 28 September 2011

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 for… Expand

TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes

- Leonardo B. Oliveira, D. Aranha, Eduardo Morais, Felipe Daguano, J. Hernandez, R. Dahab
- Computer Science
- Sixth IEEE International Symposium on Network…
- 12 July 2007

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 a… Expand

A note on high-security general-purpose elliptic curves

- D. Aranha, Paulo S. L. M. Barreto, Geovandro C. C. F. Pereira, J. E. Ricardini
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2013

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 security… Expand