Cryptanalysis of a combinatorial public key cryptosystem

DOI10.1515/gcc-2017-0013zbMath1372.94438OpenAlexW2786597063MaRDI QIDQ1676249

Vitaliĭ Roman'kov

Publication date: 6 November 2017

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

Full work available at URL: https://doi.org/10.1515/gcc-2017-0013

zbMATH Keywords

nilpotent groupfree groupcryptanalysispublic-key cryptosystemNielsen transformation

Mathematics Subject Classification ID

Cryptography (94A60) Nilpotent groups (20F18) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05)

Related Items

Analysis of secret sharing schemes based on Nielsen transformations, Algebraic and quantum attacks on two digital signature schemes, Two general schemes of algebraic cryptography

Cites Work

• Non-commutative lattice problems
• The status of polycyclic group-based cryptography: a survey and open problems
• A nonlinear decomposition attack
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms
• The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
• Polynomial-time word problems.
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Infinite groups
• The algorithmic theory of polycyclic-by-finite groups
• Automorphisms of groups
• Combinatorial group theory.
• Topics in infinite group theory. Nielsen methods, covering spaces, and hyperbolic groups
• A linear decomposition attack
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item