Injective Encodings to Elliptic CurvesReportar como inadecuado

Injective Encodings to Elliptic Curves - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 UR1 - Université de Rennes 1 2 IUF - Institut Universitaire de France 3 UPMC - Université Pierre et Marie Curie - Paris 6 4 NTT Secure Platform Laboratories Tokyo

Abstract : For a number of elliptic curve-based cryptographic protocols, it is useful and sometimes necessary to be able to encode a message a bit string as a point on an elliptic curve in such a way that the message can be efficiently and uniquely recovered from the point. This is for exam-ple the case if one wants to instantiate CPA-secure ElGamal encryption directly in the group of points of an elliptic curve. More practically rele-vant settings include Lindell-s UC commitment scheme EUROCRYPT 2011 or structure-preserving primitives. It turns out that constructing such an encoding function is not easy in general, especially if one wishes to encode points whose length is large rel-ative to the size of the curve. There is a probabilistic -folklore- method for doing so, but it only provably works for messages of length less than half the size of the curve. In this paper, we investigate several approaches to injective encoding to elliptic curves, and in particular, we propose a new, essentially opti-mal geometric construction for a large class of curves, including Edwards curves; the resulting algorithm is also quite efficient, requiring only one exponentiation in the base field and simple arithmetic operations how-ever, the curves for which the map can be constructed have a point of order two, which may be a limiting factor for possible applications. The new approach is based on the existence of a covering curve of genus 2 for which a bijective encoding is known.

Keywords : Elliptic Curve Cryptography Algebraic Curves Injective Encoding

Autor: Pierre-Alain Fouque - Antoine Joux - Mehdi Tibouchi -



Documentos relacionados