Subsets of groups in public-key cryptography

DOI10.3934/AMC.2024036MaRDI QIDQ7025882zbMATH OpenFDO

Authors André Carvalho, A. Malheiro

Publication date 19 February 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2024036

zbMATH Keywords

ascending HNN-extensionscontext-free languageskey-exchangesubsets of groups

Mathematics Subject Classification ID

Extensions, wreath products, and other compositions of groups (20E22) Algebraic theory of languages and automata (68Q70) Cryptography (94A60)

Cites work

• A new key exchange protocol based on the decomposition problem
• Algebraic and context-free subsets of subgroups
• An algebraic method for public-key cryptography
• Applications of group theory in cryptography. Post-quantum group-based cryptography
• Applied cryptography and network security. 6th international conference, ACNS 2008, New York, NY, USA, June 3--6, 2008. Proceedings
• Automorphic orbits in free groups: words versus subgroups.
• CENTRALIZERS OF ELEMENTS IN A GROUP OF TREE AUTOMORPHISMS
• Characterizations of the decidability of some problems for regular trace languages
• Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
• Cryptanalysis of the Shpilrain-Ushakov protocol for Thompson's group
• Decidability of the Brinkmann problems for endomorphisms of the free group
• Detecting automorphic orbits in free groups.
• Group-based cryptography
• Group-based Cryptography in the Quantum Era
• Group-theoretic orbit decidability.
• Growth in higher Baumslag-Solitar groups
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1759777 (Why is no real title available?)
• scientific article; zbMATH DE number 848082 (Why is no real title available?)
• Negligibity of elliptic elements in ascending HNN-extensions of \(\mathbb{Z}^m\)
• On a subclass of context-free groups
• On endomorphisms of the direct product of two free groups
• On generalized conjugacy and some related problems
• On soluble groups in which centralizers are finitely generated
• On the rational subsets of the monogenic free inverse monoid
• Orbit decidability and the conjugacy problem for some extensions of groups.
• Polynomial-time algorithm for the orbit problem
• Public key exchange using semidirect product of (semi)groups
• Rational subsets of groups
• Search and witness problems in group theory.
• THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
• The generalized conjugacy problem for virtually free groups.
• The rational subset membership problem for groups: a survey
• The submonoid and rational subset membership problems for graph groups.
• Thompson’s Group and Public Key Cryptography
• Two remarks on the first-order theories of Baumslag-Solitar groups
• Using the subgroup membership search problem in public key cryptography

Cited in

(1)

• Oblivious pseudorandom functions in non-commutative groups

This page was built for publication: Subsets of groups in public-key cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025882)