How to Hash into Elliptic Curves [chapter]

Thomas Icart
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We describe a new explicit function that given an elliptic curve E defined over Fpn, maps elements of Fpn into E in deterministic polynomial time and in a constant number of operations over Fpn . The function requires to compute a cube root. As an application we show how to hash deterministically into an elliptic curve.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-03356-8_18">doi:10.1007/978-3-642-03356-8_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jxb7hwxjsre4llnfzle2qvauri">fatcat:jxb7hwxjsre4llnfzle2qvauri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725235132/https://link.springer.com/content/pdf/10.1007%2F978-3-642-03356-8_18.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/91/fb910245fee95dada05dcb77ba62c012a4a87f63.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-03356-8_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>