| Texto completo | |
| Autor(es): |
Aranha, Diego F.
;
Azarderakhsh, Reza
;
Karabina, Koray
;
Ali, SS
;
Danger, JL
;
Eisenbarth, T
Número total de Autores: 6
|
| Tipo de documento: | Artigo Científico |
| Fonte: | SECURITY, PRIVACY, AND APPLIED CRYPTOGRAPHY ENGINEERING, SPACE 2017; v. 10662, p. 19-pg., 2017-01-01. |
| Resumo | |
Designing efficient and secure implementations of Elliptic Curve Cryptography (ECC) has attracted enormous interest from both theoreticians and practitioners. The main contenders in terms of performance are curves defined over binary extension fields or large prime characteristic fields. In addition to the efficiency requirements, security advantages such as implementation simplicity and resistance to sidechannel attacks are receiving increasing attention in research and commercial applications. In this paper, we keep pushing in this direction and study efficient implementation of regular scalar multiplication algorithms for binary curves equipped with efficient endomorphisms. Our focus is on implementing the Galbraith-Lin-Scott (GLS) family of binary curves by exploring the space of different models and laddering algorithms, for their high performance, reasonable implementation simplicity, lower memory consumption and side-channel resistance. Our results demonstrate that laddering implementations can be competitive with window-based methods by obtaining a new speed record for laddering implementations of elliptic curves on high-end Intel processors. (AU) | |
| Processo FAPESP: | 14/50704-7 - Execução segura de algoritmos criptográficos |
| Beneficiário: | Julio César López Hernández |
| Modalidade de apoio: | Auxílio à Pesquisa - Parceria para Inovação Tecnológica - PITE |