Access the full text.
Sign up today, get DeepDyve free for 14 days.
Maggie Habeeb, Delaram Kahrobaei (2013)
On the dimension of matrix representations of finitely generated torsion free nilpotent groups, 5
C. Leedham-Green, L. Soicher (1990)
Collection from the Left and Other StrategiesJ. Symb. Comput., 9
V. Shpilrain, A. Ushakov (2005)
A new key exchange protocol based on the decomposition problemArXiv, abs/math/0512140
Rafael Álvarez, L. Tortosa, José-Francisco Vicent, Antonio Zamora (2009)
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications
Maggie Habeeb, Delaram Kahrobaei, Charalambos Koupparis, V. Shpilrain (2013)
Public Key Exchange Using Semidirect Product of (Semi)GroupsArXiv, abs/1304.6572
Rafael Álvarez, Francisco Martínez, José-Francisco Vicent, Antonio Zamora (2008)
A matricial public key cryptosystem with digital signatureWSEAS Transactions on Mathematics archive, 7
Algebraic Cryptography
Applications of Abstract Algebra with MAPLE
B. Tsaban (2012)
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic CryptographyJournal of Cryptology, 28
R. Odoni, V. Varadharajan, P. Sanders (1984)
Public Key distribution in matrix ringsElectronics Letters, 20
T. Hurley (2014)
Cryptographic schemes, key exchange, public keyIACR Cryptol. ePrint Arch., 2013
J. Wilson (1984)
POLYCYCLIC GROUPS (Cambridge Tracts in Mathematics, 82)Bulletin of The London Mathematical Society, 16
Lihua Wang, Licheng Wang, Z. Cao, E. Okamoto, Jun Shao (2010)
New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems
D. Garber, S. Kaplan, M. Teicher, B. Tsaban, U. Vishne (2004)
Probabilistic Solutions of Equations in the Braid GroupAdv. Appl. Math., 35
V. Shpilrain (2008)
Cryptanalysis of Stickel's Key Exchange Scheme
S. Erofeev, V. Romankov (2012)
On constructing possibly one-way functions basedon the non-decidability of the endomorphism problem in groups
On the PSL2(q), Ra-manujan graphs and key exchange protocols
J. Lennox, D. Robinson (2004)
The Theory of Infinite Soluble Groups
María Vasco, Á. Pozo, Pedro Duarte, J. Villar (2014)
Cryptanalysis of a key exchange scheme based on block matricesInf. Sci., 276
E. Luks (1992)
Computing in solvable matrix groupsProceedings., 33rd Annual Symposium on Foundations of Computer Science
A. Myasnikov, V. Shpilrain, A. Ushakov (2008)
Group-based Cryptography
B. Eick, Gretchen Ostheimer (2003)
On the orbit-stabilizer problem for integral matrix actions of polycyclic groupsMath. Comput., 72
W. Diffie, M. Hellman (1976)
New Directions in CryptographyDemocratizing Cryptography
(2010)
On the PSL2(q), Ramanujan graphs and key exchange protocols. Available at http://aca2010.info/index.php/aca2010/aca2010/paper/viewFile/80/3
J. Cheon, B. Jun (2003)
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy ProblemIACR Cryptol. ePrint Arch., 2003
Guilin Wang (2007)
Key Agreement
Luca Trevisan (2000)
Introduction to Modern Cryptography
(1994)
Systems of open distribution of keys on the basis of noncommutative semigroups
Delaram Kahrobaei, Charalambos Koupparis, V. Shpilrain (2013)
Public key exchange using matrices over group rings, 5
(2011)
Cryptanalysis of three matrix-based key establishment protocolsJournal of Mathematical Cryptology, 5
Rafael Álvarez, L. Tortosa, José-Francisco Vicent, Antonio Zamora (2009)
Analysis and design of a secure key exchange schemeInf. Sci., 179
G. Janusz (1970)
Faithful representations of p groups at characteristic p, IIJournal of Algebra, 22
A. Myasnikov, V. Shpilrain, A. Ushakov (2011)
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Yu. Merzlyakov (1970)
Integral representation of holomorphs of polycyclic groupsAlgebra and Logic, 9
V. Romankov (2013)
Cryptanalysis of some schemes applying automorphisms
S. Bigelow (2000)
Braid groups are linearJournal of the American Mathematical Society, 14
Delaram Kahrobaei, B. Khan (2006)
NIS05-6: A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic GroupsIEEE Globecom 2006
A. Mahalanobis (2006)
The Diffie-Hellman key exchange protocol and non-abelian nilpotent groupsIsrael Journal of Mathematics, 165
E. Stickel (2005)
A New Method for Exchanging Secret KeysThird International Conference on Information Technology and Applications (ICITA'05), 2
G. Baumslag, F. Cannonito, D. Robinson, D. Segal (1991)
The algorithmic theory of polycyclic-by-finite groups☆Journal of Algebra, 142
W. Graaf, Werner Nickel (2002)
Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent GroupsJ. Symb. Comput., 33
W. Bosma, John Cannon, Catherine Playoust (1997)
The Magma Algebra System I: The User LanguageJ. Symb. Comput., 24
Mehmet, Kalkan, Hacl, Aktaş (2014)
On the Group Based Cryptography, 4
(1986)
Discrete logarithms in GF(p)
A. Shmel’kin (1968)
Polycyclic groupsSiberian Mathematical Journal, 9
L. Babai, R. Beals, Á. Seress (2009)
Polynomial-time theory of matrix groups
Werner Nickel (2006)
Matrix representations for torsion-free nilpotent groups by Deep ThoughtJournal of Algebra, 300
P. Holmes, S. Linton, E. O'Brien, A. Ryba, R. Wilson (2008)
Constructive membership in black-box groups, 11
E. Sakalauskas, Povilas Tvarijonas, Andrius Raulynaitis (2007)
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation LevelInformatica, 18
V. Romankov (2012)
Diophantine cryptography over innite groups
Iris Anshel, M. Anshel, D. Goldfeld (1999)
An algebraic method for public-key cryptographyMathematical Research Letters, 6
D. Grigoriev, V. Shpilrain (2010)
Authentication from Matrix Conjugation, 1
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
V. Shpilrain, A. Ushakov (2005)
Thompson's Group and Public Key Cryptography
(2009)
On the number of p-regular elements in simple groups
A LINEAR DECOMPOSITION ATTACK
C. Parker, R. Wilson (2005)
Recognising simplicity of black-box groups
B. Hurley, T. Hurley (2011)
Group ring cryptographyArXiv, abs/1104.1724
Abstract We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in all the schemes under consideration. Furthermore, we show that in this case, contrary to the common opinion, the typical computational security assumptions are not very relevant to the security of the schemes, i.e., one can break the schemes without solving the algorithmic problems on which the assumptions are based.
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2015
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.