Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/cryptanalysis-of-a-combinatorial-public-key-cryptosystem-rwRkUnCQZ5
References (13)
-
Jean-Louis Roch, G. Villard (1996)
Fast Parallel Computation of the Jordan Normal Form of MatricesParallel Process. Lett., 6
-
A. Moldenhauer, G. Rosenberger (2015)
Cryptographic Protocols Based on Nielsen TransformationsJournal of Computational Chemistry, 4
-
V. Roman’kov (2015)
Linear Decomposition Method in Analyzing Hidden Information Protocols on Algebraic PlatformsAlgebra and Logic, 54
-
S. Schleimer (2006)
POLYNOMIAL-TIME WORD PROBLEMSCommentarii Mathematici Helvetici, 83
-
T. Beelen, P. Dooren (1988)
An improved algorithm for the computation of Kronecker's canonical form of a singular pencilLinear Algebra and its Applications, 105
-
A. Myasnikov, Andrey Nikolaev, A. Ushakov (2015)
Non-commutative lattice problemsJournal of Group Theory, 19
-
G. Golub, J. Wilkinson (1975)
Ill-conditioned eigensystems and the computation of the Jordan canonical form -
V. Roman’kov (1992)
Automorphisms of groupsActa Applicandae Mathematica, 29
-
B. Tsaban (2012)
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic CryptographyJournal of Cryptology, 28
-
A. Mahalanobis (2006)
The Diffie-Hellman key exchange protocol and non-abelian nilpotent groupsIsrael Journal of Mathematics, 165
-
G. Baumslag, F. Cannonito, D. Robinson, D. Segal (1991)
The algorithmic theory of polycyclic-by-finite groups☆Journal of Algebra, 142
-
T. Elgamal (1984)
A public key cryptosystem and a signature scheme based on discrete logarithms -
Bren Cavallo, Delaram Kahrobaei (2014)
A family of polycyclic groups over which the uniform conjugacy problem is NP-completeArXiv, abs/1403.4153
- Publisher
- de Gruyter
- Copyright
- © 2017 Walter de Gruyter GmbH, Berlin/Boston
- ISSN
- 1869-6104
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc-2017-0013
- Publisher site
- See Article on Publisher Site
Abstract
AbstractWe discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.
Journal
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2017