Welcome to the resource topic for 2017/1202
Title:
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs
Authors: Javad Doliskani, Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto
Abstract:We propose a variant of the CGL hash, Charles et al. 2009, that is significantly faster than the original algorithm, and prove that it is preimage and collision resistant. For n = \log p where p is the characteristic of the finite field, the performance ratio between CGL and the new proposal is (5.7n + 110) / (13.5\log n + 46.4). This gives an exponential speed up as the size of p increases. Assuming the best quantum preimage attack on the hash has complexity O(p^{\frac{1}{4}}), we attain a concrete speed-up for a 256-bit quantum preimage security level by a factor 33.5. For a 384-bit quantum preimage security level, the speed-up is by a factor 47.8.
ePrint: https://eprint.iacr.org/2017/1202
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .