Public key cryptography based on twisted dihedral group algebras

نویسندگان

چکیده

<p style='text-indent:20px;'>In this paper, we propose to use a twisted dihedral group algebra for public-key cryptography. For this, introduce new <inline-formula><tex-math id="M1">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>-cocycle id="M2">\begin{document}$ \alpha_{\lambda} $\end{document}</tex-math></inline-formula> twist the algebra. Using ambient space id="M3">\begin{document}$ \mathbb{F}^{\alpha_{\lambda}} D_{2n} $\end{document}</tex-math></inline-formula>, then key exchange protocol and present an analysis of its security. Moreover, explore properties resulting id="M4">\begin{document}$ \mathbb{F}^{\alpha_{\lambda}}D_{2n} exploiting them enhance our protocol. We also probabilistic scheme derived from key-exchange obtain encapsulation mechanism (KEM) by applying well-known generic transformation scheme. Finally, proof-of-concept implementation mechanism.</p>

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Public key cryptography based on some extensions of group

Bogopolski, Martino and Ventura in [BMV10] introduced a general criteria to construct groups extensions with unsolvable conjugacy problem using short exact sequences. We prove that such extensions have always solvable word problem. This makes the proposed construction a systematic way to obtain finitely presented groups with solvable word problem and unsolvable conjugacy problem. It is believed...

متن کامل

RFID Privacy Based on Public-Key Cryptography

RFID systems makes it possible for a server to identify known tags in wireless settings. As they become more and more pervasive, people privacy is more and more threatened. In this talk, we list a few models for privacy in RFID and compare them. We review a few protocols. We further show that strong privacy mandates the use of public-key cryptography. Finally, we present a new cryptosystem whic...

متن کامل

Public Key Cryptography based on Semigroup Actions

A generalization of the original Diffie-Hellman key exchange in (Z/pZ) found a new depth when Miller [27] and Koblitz [16] suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further vast generalization where abelian semigroups act on finite sets. We define a Diffie-Hellman key exchange in this setting and we illustrate how to build in...

متن کامل

Public-Key Cryptography Based on Modular Lattices

We present an approach to generalization of practical Identity-Based Encryption scheme of [BF01]. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.

متن کامل

Public key cryptography based on coding theory

In this thesis we view the statistical decoding algorithm, which tries to solve the general decoding problem as well as the variants of the McEliece cryptosystem based on Gabidulin codes. The first part of the thesis is dedicated to the general concept of public key cryptography on the basis of coding theory and the security of the underlying problems. Thus after presenting the basic principles...

متن کامل

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


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

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2022

ISSN: ['1930-5346', '1930-5338']

DOI: https://doi.org/10.3934/amc.2022031