Extractors for binary elliptic curves

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extractors for binary elliptic curves

A deterministic extractor for an elliptic curve is a function that converts a random point on the curve to a random-looking bit-string, which is statistically close to a uniformly random bit-string. The problem of converting random points of an elliptic curve into random bits has several cryptographic applications. In this talk, we propose two simple and efficient deterministic extractors for a...

متن کامل

Two-sources Randomness Extractors for Elliptic Curves

This paper studies the task of two-sources randomness extractors for elliptic curves defined over a finite field K, where K can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which take in input two random points from two different subgroups. In other words, for a given elliptic curve E defined over a finite field Fq and two random points...

متن کامل

Lambda Coordinates for Binary Elliptic Curves

In this work we present the λ-coordinates, a new system for representing points in binary elliptic curves. We also provide efficient elliptic curve operations based on the new representation and timing results of our software implementation over the field F2254 . As a result, we improve speed records for protected/unprotected single/multi-core software implementations of random-point elliptic c...

متن کامل

Point Decomposition Problem in Binary Elliptic Curves

We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear system of equations derived from the so called Semaev summation polynomials. We modify the underlying system of equations by introducing some auxiliary variables. We argue that the trade-off between l...

متن کامل

Faster Repeated Doublings on Binary Elliptic Curves

The use of precomputed data to speed up a cryptographic protocol is commonplace. For instance, the owner of a public point P on an elliptic curve can precompute various points of the form [2]P and transmit them together with P . One inconvenience of this approach though may be the amount of information that needs to be exchanged. In the situation where the bandwidth of the transmissions is limi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2008

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-008-9187-5