Polynomial approximation of bilinear Diffie–Hellman maps

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

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

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

منابع مشابه

Polynomial approximation of bilinear Diffie-Hellman maps

The problem of computing Bilinear-Diffie-Hellman maps is considered. It is shown that the problem of computing the map is equivalent to computing a diagonal version of it. Various lower bounds on the degree of any polynomial that interpolates this diagonal version of the map are found that shows that such an interpolation will involve a polynomial of large degree, relative to the size of the se...

متن کامل

Arens regularity of bilinear maps and Banach modules actions

‎Let $X$‎, ‎$Y$ and $Z$ be Banach spaces and $f:Xtimes Y‎ ‎longrightarrow Z$ a bounded bilinear map‎. ‎In this paper we‎ ‎study the relation between Arens regularity of $f$ and the‎ ‎reflexivity of $Y$‎. ‎We also give some conditions under which the‎ ‎Arens regularity of a Banach algebra $A$ implies the Arens‎ ‎regularity of certain Banach right module action of $A$‎ .

متن کامل

Bilinear maps and convolutions

Let X,Y, Z be Banach spaces and let u : X×Y → Z be a bounded bilinear map. Given a locally compact abelian group G , and two functions f ∈ L(G,X) and g ∈ L(G,Y ), we define the u -convolution of f and g as the Z -valued function f ∗u g(t) = ∫ G u(f(t− s), g(s))dμG(s) where dμG stands for the Haar measure on G . We define the concepts of vector-valued approximate identity and summability kernel ...

متن کامل

Bilinear Accelerated Filter Approximation

Our method approximates exact texture filtering for arbitrary scales and translations of an image while taking into account the performance characteristics of modern GPUs. Our algorithm is fast because it accesses textures with a high degree of spatial locality. Using bilinear samples guarantees that the texels we read are in a regular pattern and that we use a hardware accelerated path. We con...

متن کامل

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing properties of the schemes is that it achieves shorter public parameters than previous schemes. Both of our schemes follow the general framework presented in the recent IBE scheme of Yamada (Eurocrypt 2016), employed with novel techniques tailored to meet the underlying algebraic st...

متن کامل

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


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

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2008

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2007.03.002