5 research outputs found
Constructing Permutation Rational Functions From Isogenies
A permutation rational function is a rational function
that induces a bijection on , that is, for all
there exists exactly one such that . Permutation
rational functions are intimately related to exceptional rational functions,
and more generally exceptional covers of the projective line, of which they
form the first important example.
In this paper, we show how to efficiently generate many permutation rational
functions over large finite fields using isogenies of elliptic curves, and
discuss some cryptographic applications. Our algorithm is based on Fried's
modular interpretation of certain dihedral exceptional covers of the projective
line (Cont. Math., 1994)
Simultaneously simple universal and indifferentiable hashing to elliptic curves
The present article explains how to generalize the hash function SwiftEC (in an elementary quasi-unified way) to any elliptic curve over any finite field of characteristic . The new result apparently brings the theory of hash functions onto elliptic curves to its logical conclusion. To be more precise, this article provides compact formulas that define a hash function (deterministic and indifferentible from a random oracle) with the same working principle as SwiftEC. In particular, both of them equally compute only one square root in (in addition to two cheap Legendre symbols). However, the new hash function is valid with much more liberal conditions than SwiftEC, namely when . Since in the opposite case there are already indifferentiable constant-time hash functions to with the cost of one root in , this case is not processed in the article. If desired, its approach nonetheless allows to easily do that mutatis mutandis
Some remarks on how to hash faster onto elliptic curves
This article proposes four optimizations of indifferentiable hashing onto (prime-order subgroups of) ordinary elliptic curves over finite fields . One of them is dedicated to elliptic curves without non-trivial automorphisms provided that . The second deals with and an elliptic curve of -invariant . The corresponding section plays a rather theoretical role, because (the quadratic twist of) is not used in real-world cryptography. The other two optimizations take place for the subgroups , of pairing-friendly curves. The performance gain comes from the smaller number of required exponentiations in for hashing to , , and as well as from the absence of necessity to hash directly onto in certain settings. In particular, the last insight allows to drastically speed up verification of the aggregate BLS signature incorporated in many blockchain technologies. The new results affect, for example, the pairing-friendly curve BLS12-381 (the most popular in practice at the moment) and a few plain curves from the American standard NIST SP 800-186. Among other things, a taxonomy of state-of-the-art hash functions to elliptic curves is presented. Finally, the article discusses how to hash over highly -adic fields
SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves
Hashing arbitrary values to points on an elliptic curve is a required step in many cryptographic constructions, and a number of techniques have been proposed to do so over the years. One of the first ones was due to Shallue and van de Woestijne (ANTS-VII), and it had the interesting property of applying to essentially all elliptic curves over finite fields. It did not, however, have the desirable property of being indifferentiable from a random oracle when composed with a random oracle to the base field.
Various approaches have since been considered to overcome this limitation, starting with the foundational work of Brier et al. (CRYPTO 2011). For example, if is the Shallue--van de Woestijne (SW) map and are two independent random oracles to , we now know that is indifferentiable from a random oracle. Unfortunately, this approach has the drawback of being twice as expensive to compute than the straightforward, but not indifferentiable, . Most other solutions so far have had the same issue: they are at least as costly as two base field exponentiations, whereas plain encoding maps like cost only one exponentiation. Recently, Koshelev (DCC 2022) provided the first construction of indifferentiable hashing at the cost of one exponentiation, but only for a very specific class of curves (some of those with -invariant ), and using techniques that are unlikely to apply more broadly.
In this work, we revisit this long-standing open problem, and observe that the SW map actually fits in a one-parameter family of encodings, such that for independent random oracles to , is indifferentiable. Moreover, on a very large class of curves (essentially those that are either of odd order or of order divisible by 4), the one-parameter family admits a rational parametrization, which let us compute at almost the same cost as small , and finally achieve indifferentiable hashing to most curves with a single exponentiation.
Our new approach also yields an improved variant of the Elligator Squared technique of Tibouchi (FC 2014) that represents points of arbitrary elliptic curves as close-to-uniform random strings