Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Batty, S. Braunstein, A. Duncan, Sarah Rees (2003)
Quantum algorithms in group theory
C. Leedham-Green, L. Soicher (1990)
Collection from the Left and Other StrategiesJ. Symb. Comput., 9
(1990)
Leedham-Green and L.
O. Bogopolski, O. Bogopolski, A. Martino, E. Ventura (2007)
Orbit decidability and the conjugacy problem for some extensions of groupsTransactions of the American Mathematical Society, 362
V. Roman’kov (2009)
The twisted conjugacy problem for endomorphisms of polycyclic groups, 13
B. Tsaban (2012)
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic CryptographyJournal of Cryptology, 28
PhD Program in Computer Science, City University of New York E-mail address: jgryak@gradcenter.cuny
A. Myasnikov, V. Roman’kov (2014)
A linear decomposition attackGroups Complexity Cryptology, 7
J. Milnor (1968)
Growth of finitely generated solvable groupsJournal of Differential Geometry, 2
M. Sautoy (2002)
Polycyclic Groups, Analytic Groups and Algebraic GroupsProceedings of the London Mathematical Society, 85
A. Fesenko (2014)
Vulnerability of Cryptographic Primitives Based on the Power Conjugacy Search Problem in Quantum ComputingCybernetics and Systems Analysis, 50
V. Gebhardt (2002)
Efficient Collection in Infinite Polycyclic GroupsJ. Symb. Comput., 34
B. Wehrfritz (1994)
Two Remarks on Polycyclic GroupsBulletin of The London Mathematical Society, 26
A. Myasnikov, A. Ushakov (2007)
Random subgroups and analysis of the length-based and quotient attacks, 2
B. Eick, Gretchen Ostheimer (2003)
On the orbit-stabilizer problem for integral matrix actions of polycyclic groupsMath. Comput., 72
A. Myasnikov, A. Ushakov (2007)
Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
(1983)
On homomorphisms onto finite groups
M. Kotov, A. Ushakov (2015)
Analysis of a certain polycyclic-group-based cryptosystemJournal of Mathematical Cryptology, 9
J. Wolf (1968)
Growth of finitely generated solvable groups and curvature of Riemannian manifoldsJournal of Differential Geometry, 2
James Hughes, A. Tannenbaum (2003)
Length-Based Attacks for Certain Group Based Encryption Rewriting SystemsIACR Cryptol. ePrint Arch., 2003
M. Dehn (1911)
Über unendliche diskontinuierliche GruppenMathematische Annalen, 71
(1969)
The Edmonton notes on nilpotent groups
A. Myasnikov, V. Shpilrain, A. Ushakov (2011)
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
V. Remeslennikov (1969)
Conjugacy in polycyclic groupsAlgebra and Logic, 8
V. Shpilrain, Gabriel Zapata (2005)
USING THE SUBGROUP MEMBERSHIP SEARCH PROBLEM IN PUBLIC KEY CRYPTOGRAPHY
D. Segal (1990)
Decidable Properties of Polycyclic GroupsProceedings of The London Mathematical Society
Delaram Kahrobaei, B. Khan (2006)
NIS05-6: A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic GroupsIEEE Globecom 2006
E. Formanek (1976)
Conjugate separability in polycyclic groupsJournal of Algebra, 42
G. Ivanyos, L. Sanselme, M. Santha (2007)
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 GroupsAlgorithmica, 62
B. Eick, Delaram Kahrobaei (2004)
POLYCYCLIC GROUPS: A NEW PLATFORM FOR CRYPTOLOGY?arXiv: Group Theory
Alice chooses an endomorphism φ : S → S as her private key. Alice then chooses elements s, t ∈ S such that t = φ ( s )
Eddie Lo, Gretchen Ostheimer (1999)
A Practical Algorithm for Finding Matrix Representations for Polycyclic GroupsJ. Symb. Comput., 28
V. Shpilrain, A. Ushakov (2008)
An Authentication Scheme Based on the Twisted Conjugacy Problem
Werner Nickel (2006)
Matrix representations for torsion-free nilpotent groups by Deep ThoughtJournal of Algebra, 300
Björn Assmann, S. Linton (2007)
Using the Mal'cev correspondence for collection in polycyclic groupsJournal of Algebra, 316
B. Eick (2003)
WHEN IS THE AUTOMORPHISM GROUP OF A VIRTUALLY POLYCYCLIC GROUP VIRTUALLY POLYCYCLIC?Glasgow Mathematical Journal, 45
D. Garber, S. Kaplan, M. Teicher, B. Tsaban, U. Vishne (2002)
LENGTH-BASED CONJUGACY SEARCH IN THE BRAID GROUParXiv: Group Theory
What is the complexity of the search endomorphism (automorphism) problem in polycyclic groups?
IEEE Global Telecommunications Conference
P. Shor (1994)
Algorithms for quantum computation: discrete logarithms and factoringProceedings 35th Annual Symposium on Foundations of Computer Science
Iris Anshel, M. Anshel, D. Goldfeld (1999)
An algebraic method for public-key cryptographyMathematical Research Letters, 6
V. Shpilrain (2010)
Search and witness problems in group theory, 2
Delaram Kahrobaei, Charalambos Koupparis (2012)
Non-commutative digital signatures, 4
D. Grigoriev, V. Shpilrain (2008)
Authentication schemes from actions on graphs, groups, or ringsIACR Cryptol. ePrint Arch., 2010
V. Shpilrain, A. Ushakov (2004)
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and InsufficientApplicable Algebra in Engineering, Communication and Computing, 17
K. Ko, Sangjin Lee, J. Cheon, Jae-Woo Han, Ju-Sung Kang, Choonsik Park (2000)
New Public-Key Cryptosystem Using Braid Groups
D. Garber, Delaram Kahrobaei, Ha Lam (2013)
Length-based attacks in polycyclic groupsJournal of Mathematical Cryptology, 9
J. Michel (2006)
Handbook of computational group theoryMath. Comput., 75
Maggie Habeeb, Delaram Kahrobaei, V. Shpilrain (2012)
A Secret Sharing Scheme Based on Group Presentations and the Word ProblemIACR Cryptol. ePrint Arch., 2012
L. Auslander (1969)
The Automorphism Group of a Polycyclic GroupAnnals of Mathematics, 89
Abstract Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups. Moreover, the non-virtually nilpotent ones exhibit an exponential growth rate. These properties make them suitable for use in group-based cryptography, which was proposed in 2004 by Eick and Kahrobaei ( 10 ). Since then, many cryptosystems have been created that employ polycyclic groups. These include key exchanges such as non-commutative ElGamal, authentication schemes based on the twisted conjugacy problem, and secret sharing via the word problem. In response, heuristic and deterministic methods of cryptanalysis have been developed, including the length-based and linear decomposition attacks. Despite these efforts, there are classes of infinite polycyclic groups that remain suitable for cryptography. The analysis of algorithms for search and decision problems in polycyclic groups has also been developed. In addition to results for the aforementioned problems we present those concerning polycyclic representations, group morphisms, and orbit decidability. Though much progress has been made, many algorithmic and complexity problems remain unsolved; we conclude with a number of them. Of particular interest is to show that cryptosystems using infinite polycyclic groups are resistant to cryptanalysis on a quantum computer.
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.