An RSA Cryptosystem over a Halidon Group Ring of a Dihedral Group

• URL: http://arxiv.org/abs/2410.20912v1
• Date: Mon, 28 Oct 2024 10:44:16 GMT
• Title: An RSA Cryptosystem over a Halidon Group Ring of a Dihedral Group
• Authors: A. Telveenus,
• Abstract summary: The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. The logic used to develop a decryption programme was also quite complex.
• Score: 0.0
• License:
• Abstract: The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. Due to the non-abelian nature of the group, constructing the cryptosystem is more challenging compared to an abelian group. The logic used to develop a decryption programme was also quite complex.

Related papers

• Contracting Self-similar Groups in Group-Based Cryptography [0.0]
  We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP) The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be non-linear. We discuss benefits and drawbacks of using these groups in group-based cryptography and provide computational analysis of variants of the length-based attack on SCSP.
  arXiv  Detail & Related papers  (2024-08-26T15:30:11Z)
• An encryption algorithm using a generalization of the Markovski algorithm and a system of orthogonal operations based on T-quasigroups [45.67330863443465]
  We present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups. In this paper, we present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups.
  arXiv  Detail & Related papers  (2024-07-20T12:38:07Z)
• Two RSA-based Cryptosystems [0.0]
  The cryptosystem RSA is a very popular cryptosystem in the study of Cryptography. In this article, we explore how the idea of a primitive mth root of unity in a ring can be integrated into the Discrete Fourier Transform.
  arXiv  Detail & Related papers  (2024-05-17T18:35:29Z)
• Cryptanalysis of protocols using (Simultaneous) Conjugacy Search Problem in certain Metabelian Platform Groups [0.0]
  There are many group-based cryptosystems in which the security relies on the difficulty of solving Conjugacy Search Problem (CSP) and Simultaneous Conjugacy Search Problem (SCSP) in their underlying platform groups. In this paper we give a cryptanalysis of these systems which use certain semidirect product of abelian groups.
  arXiv  Detail & Related papers  (2023-09-25T07:50:25Z)
• Lattice attack on group ring NTRU: The case of the dihedral group [2.106410091047004]
  This paper shows that dihedral groups do not guarantee better security against lattice attacks on the public key of NTRU-like cryptosystems. We prove that retrieving the private key is possible by solving the SVP in two lattices with half the dimension of the original lattice generated for GR-NTRU based on dihedral groups.
  arXiv  Detail & Related papers  (2023-09-15T10:50:46Z)
• Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era [0.0]
  We review some applications of finite non-abelian simple groups to cryptography and discuss different scenarios in which this theory is clearly central. We look at constructions based on various group-theoretic factorization problems, review group theoretical hash functions, and discuss fully homomorphic encryption using simple groups.
  arXiv  Detail & Related papers  (2023-08-28T17:30:00Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Robustifying Algorithms of Learning Latent Trees with Vector Variables [92.18777020401484]
  We present the sample complexities of Recursive Grouping (RG) and Chow-Liu Recursive Grouping (CLRG) We robustify RG, CLRG, Neighbor Joining (NJ) and Spectral NJ (SNJ) by using the truncated inner product. We derive the first known instance-dependent impossibility result for structure learning of latent trees.
  arXiv  Detail & Related papers  (2021-06-02T01:37:52Z)
• Learning Multi-Attention Context Graph for Group-Based Re-Identification [214.84551361855443]
  Learning to re-identify or retrieve a group of people across non-overlapped camera systems has important applications in video surveillance. In this work, we consider employing context information for identifying groups of people, i.e., group re-id. We propose a novel unified framework based on graph neural networks to simultaneously address the group-based re-id tasks.
  arXiv  Detail & Related papers  (2021-04-29T09:57:47Z)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Constraints on Maximal Entanglement Under Groups of Permutations [73.21730086814223]
  Sets of entanglements are inherently equal, lying in the same orbit under the group action. We introduce new, generalized relationships for the maxima of those entanglement by exploiting the normalizer and normal subgroups of the physical symmetry group.
  arXiv  Detail & Related papers  (2020-11-30T02:21:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.