dc.contributor.author Budroni, Alessandro dc.contributor.author Pintore, Federico dc.date.accessioned 2021-05-26T13:00:06Z dc.date.available 2021-05-26T13:00:06Z dc.date.created 2020-09-07T21:58:31Z dc.date.issued 2022 dc.Published Applicable Algebra in Engineering, Communication and Computing. 2022, 33, 261-281. dc.identifier.issn 0938-1279 dc.identifier.uri https://hdl.handle.net/11250/2756472 dc.description.abstract When a pairing e:G1×G2→GT, on an elliptic curve E defined over a finite field Fq, is exploited for an identity-based protocol, there is often the need to hash binary strings into G1 and G2. Traditionally, if E admits a twist E~ of order d, then G1=E(Fq)∩E[r], where r is a prime integer, and G2=E~(Fqk/d)∩E~[r], where k is the embedding degree of E w.r.t. r. The standard approach for hashing into G2 is to map to a general point P∈E~(Fqk/d) and then multiply it by the cofactor c=#E~(Fqk/d)/r. Usually, the multiplication by c is computationally expensive. In order to speed up such a computation, two different methods—by Scott et al. (International conference on pairing-based cryptography. Springer, Berlin, pp 102–113, 2009) and by Fuentes-Castaneda et al. (International workshop on selected areas in cryptography)—have been proposed. In this paper we consider these two methods for BLS pairing-friendly curves having k∈{12,24,30,42,48}, providing efficiency comparisons. When k=42,48, the application of Fuentes et al. method requires expensive computations which were infeasible for the computational power at our disposal. For these cases, we propose hashing maps that we obtained following Fuentes et al. idea. en_US dc.language.iso eng en_US dc.publisher Springer en_US dc.rights Navngivelse 4.0 Internasjonal * dc.rights.uri http://creativecommons.org/licenses/by/4.0/deed.no * dc.title Efficient hash maps to G2 on BLS curves en_US dc.type Journal article en_US dc.type Peer reviewed en_US dc.description.version publishedVersion en_US dc.rights.holder Copyright 2020 The Authors en_US cristin.ispublished true cristin.fulltext original cristin.qualitycode 2 dc.identifier.doi 10.1007/s00200-020-00453-9 dc.identifier.cristin 1827933 dc.source.journal Applicable Algebra in Engineering, Communication and Computing en_US dc.source.pagenumber 261-281 dc.identifier.citation Applicable Algebra in Engineering, Communication and Computing. 2022, 33, 261-281. en_US dc.source.volume 33
﻿

Denne innførselen finnes i følgende samling(er)

Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal