Cryptanalysis of a combinatorial public key cryptosystem
type: Item
instance of: scholarly article
title: Cryptanalysis of a combinatorial public key cryptosystem
zbMATH Open document ID: 1372.94438
author: Vitaliĭ Roman'kov
publication date: 2017-11-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 20E05
Mathematics Subject Classification ID: 20E36
Mathematics Subject Classification ID: 20F18
zbMATH DE Number: 6803059
zbMATH Keywords: cryptanalysis
zbMATH Keywords: public-key cryptosystem
zbMATH Keywords: free group
zbMATH Keywords: Nielsen transformation
zbMATH Keywords: nilpotent group
MaRDI profile type: Publication
full work available at URL: gcc-2017-0013
OpenAlex ID: W2786597063
cites work: The algorithmic theory of polycyclic-by-finite groups
cites work: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
cites work: A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
cites work: New directions in cryptography
cites work: Q4003725
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Topics in infinite group theory. Nielsen methods, covering spaces, and hyperbolic groups
cites work: Q3254327
cites work: Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
cites work: The status of polycyclic group-based cryptography: a survey and open problems
cites work: Q3253828
cites work: Q5612538
cites work: Q4536800
cites work: Q4312125
cites work: Q4820338
cites work: Combinatorial group theory.
cites work: Q4135772
cites work: The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
cites work: Q5281585
cites work: Non-commutative lattice problems
cites work: A linear decomposition attack
cites work: Infinite groups
cites work: Automorphisms of groups
cites work: Q5150587
cites work: Linear decomposition method in analyzing hidden information protocols on algebraic platforms
cites work: A nonlinear decomposition attack
cites work: Polynomial-time word problems.
cites work: Q4285784
cites work: Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
DOI: 10.1515/GCC-2017-0013
published in: Groups - Complexity - Cryptology
description: scientific article; zbMATH DE number 6803059