%A Faz-Hernández, Armando
%A López, Julio
%D 2020
%T Generation of Elliptic Curve Points in Tandem
%K
%X A hash to curve function H, mapping bit strings to points on an elliptic curve, is often required in cryptographic schemes based on elliptic curves. Its construction is based on a deterministic encoding and a cryptographic hash function, which complementarily dominate its execution time. To improve the performance of H, we propose a parallel strategy where two units execute in tandem the internal operations of H. We instantiate this approach with a parallel software implementation of a hash to curve function that outputs points on a twisted Edwards curve. A performance benchmark on Haswell and Skylake micro-architectures shows that our parallel implementation is 1.4 times faster than its sequential implementation.
%U https://sol.sbc.org.br/index.php/sbseg/article/view/19230
%J Anais do Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg)
%0 Journal Article
%R 10.5753/sbseg.2020.19230
%P 97-105%@ 0000-0000
%8 2020-10-13