The status of polycyclic group-based cryptography: a survey and open problems

DOI10.1515/gcc-2016-0013zbMath1353.94050arXiv1607.05819OpenAlexW2963307827MaRDI QIDQ338844

Delaram Kahrobaei, Jonathan Gryak

Publication date: 7 November 2016

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.05819

zbMATH Keywords

complexitycryptographypolycyclic groups

Mathematics Subject Classification ID

Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (11)

The Reidemeister spectrum of 2-step nilpotent groups determined by graphs ⋮ Algorithms for twisted conjugacy classes of polycyclic-by-finite groups ⋮ Cryptanalysis of a combinatorial public key cryptosystem ⋮ Efficient and secure delegation of exponentiation in general groups to a single malicious server ⋮ GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS ⋮ A NONLINEAR DECOMPOSITION METHOD IN ANALYSIS OF SOME ENCRYPTION SCHEMES USING GROUP AUTOMORPHISMS ⋮ Unnamed Item ⋮ Algorithmic problems in Engel groups and cryptographic applications ⋮ Solving the Conjugacy Decision Problem via Machine Learning ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics ⋮ Two general schemes of algebraic cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Authentication schemes from actions on graphs, groups, or rings
• Analysis of a certain polycyclic-group-based cryptosystem
• Collection from the left and other strategies
• Conjugacy in polycyclic groups
• Conjugate separability in polycyclic groups
• An algebraic method for public-key cryptography
• Efficient collection in infinite polycyclic groups.
• A practical algorithm for finding matrix representations for polycyclic groups
• Length-based attacks in polycyclic groups
• Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing
• A linear decomposition attack
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• Using the Mal'cev correspondence for collection in polycyclic groups.
• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Growth of finitely generated solvable groups
• The automorphism group of a polycyclic group
• Growth of finitely generated solvable groups and curvature of Riemannian manifolds
• A Secret Sharing Scheme Based on Group Presentations and the Word Problem
• Non-commutative digital signatures
• Search and witness problems in group theory
• POLYCYCLIC GROUPS, ANALYTIC GROUPS AND ALGEBRAIC GROUPS
• Random subgroups and analysis of the length-based and quotient attacks
• Orbit decidability and the conjugacy problem for some extensions of groups
• The twisted conjugacy problem for endomorphisms of polycyclic groups
• Decidable Properties of Polycyclic Groups
• WHEN IS THE AUTOMORPHISM GROUP OF A VIRTUALLY POLYCYCLIC GROUP VIRTUALLY POLYCYCLIC?
• On homomorphisms onto finite groups
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• Two Remarks on Polycyclic Groups
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol

This page was built for publication: The status of polycyclic group-based cryptography: a survey and open problems