Subsets of groups in public-key cryptography

• URL: http://arxiv.org/abs/2311.15039v1
• Date: Sat, 25 Nov 2023 14:35:36 GMT
• Title: Subsets of groups in public-key cryptography
• Authors: André Carvalho, António Malheiro,
• Abstract summary: We present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of free-abelian groups. We also introduce several new group theoretic problems arising from this work.
• Score: 0.46960837342692324
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of free-abelian groups and discuss their resistance to length and distance based attacks. We also introduce several new group theoretic problems arising from this work.

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)
• A Lie Group Approach to Riemannian Batch Normalization [59.48083303101632]
  This paper establishes a unified framework for normalization techniques on Lie groups. We focus on Symmetric Positive Definite (SPD), which possess three distinct types of Lie group structures. Specific normalization layers induced by these Lie groups are then proposed for SPD neural networks.
  arXiv  Detail & Related papers  (2024-03-17T16:24:07Z)
• Learning with Errors over Group Rings Constructed by Semi-direct Product [26.148950348885972]
  Group ring LWE (GR-LWE) is an extension of the Learning with Errors (LWE) problem. As an extension of Ring-LWE, GR-LWE maintains computational hardness and can be potentially applied in many scenarios. GR-LWE samples can be leveraged to construct semantically secure public-keysystems.
  arXiv  Detail & Related papers  (2023-11-27T14:38:36Z)
• 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)
• Discovering Sparse Representations of Lie Groups with Machine Learning [55.41644538483948]
  We show that our method reproduces the canonical representations of the generators of the Lorentz group. This approach is completely general and can be used to find the infinitesimal generators for any Lie group.
  arXiv  Detail & Related papers  (2023-02-10T17:12:05Z)
• A Proposition-Level Clustering Approach for Multi-Document Summarization [82.4616498914049]
  We revisit the clustering approach, grouping together propositions for more precise information alignment. Our method detects salient propositions, clusters them into paraphrastic clusters, and generates a representative sentence for each cluster by fusing its propositions. Our summarization method improves over the previous state-of-the-art MDS method in the DUC 2004 and TAC 2011 datasets.
  arXiv  Detail & Related papers  (2021-12-16T10:34:22Z)
• The dihedral hidden subgroup problem [0.0]
  We give an exposition of the hidden problem for dihedral groups from the point of view of the standard subgroup quantum algorithm for finite groups. We explain a new connection between the dihedral coset problem and cloning of quantum states.
  arXiv  Detail & Related papers  (2021-06-18T04:19:10Z)
• Author Clustering and Topic Estimation for Short Texts [69.54017251622211]
  We propose a novel model that expands on the Latent Dirichlet Allocation by modeling strong dependence among the words in the same document. We also simultaneously cluster users, removing the need for post-hoc cluster estimation. Our method performs as well as -- or better -- than traditional approaches to problems arising in short text.
  arXiv  Detail & Related papers  (2021-06-15T20:55:55Z)
• 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.