Efficient Construction of CGL Hash Function Using Legendre Curves
نویسندگان
چکیده
The CGL hash function is a provably secure using walks on isogeny graphs of supersingular elliptic curves. A dominant cost its computation comes from iterative computations power roots over quadratic extension fields. In this paper, we reduce the necessary number root by almost half, applying and also extending an existing method efficient sequence Legendre curves (Hashimoto Nuida, CASC 2021). We point out some relationship between 2-isogenies for those Edwards curves, which independent interests, develop 2e-th in
منابع مشابه
Modern Hash Function Construction
This paper discusses modern hash function construction using the NIST SHA-3 competition as a survey of modern hash function construction properties. Three primary hash function designs are identified based on the designs of SHA-3 candidates submitted as part of the NIST SHA-3 competition. These designs are Widepipe, Sponge, and HAsh Iterated FrAmework (HAIFA). Keywordscryptography; hashing; has...
متن کاملLegendre Transformations of Curves
In a recent paper of Wintner [l ], an extension is made of a classical theorem on the Legendre transformation of a convex function (for details of the proof, see [3], and for related results, cf. [4; 5]). His assumptions are that the function be strictly convex and of class C1. Here we shall prove a more general result which eliminates both of these restrictions and shows that, in a sense, they...
متن کاملAn Indifferentiable Hash Function into Elliptic Curves
We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an elliptic-curve, for example Icart’s function or the Shallue-Woestijne-Ulas (SWU) algorithm.
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2023
ISSN: ['1745-1337', '0916-8508']
DOI: https://doi.org/10.1587/transfun.2022dmp0003