Cryptanalysis of a combinatorial public key cryptosystem

DOI10.1515/GCC-2017-0013zbMATH Open1372.94438OpenAlexW2786597063MaRDI QIDQ1676249FDOQ1676249

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5973815
• A proposed public key cryptosystem using the modular group
• scientific article; zbMATH DE number 1186880
• Cryptanalysis of two combinatorial public key cryptosystems
• Cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem

zbMATH Keywords

free groupcryptanalysisnilpotent grouppublic-key cryptosystemNielsen transformation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Title not available (Why is that?)
• Non-commutative lattice problems
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-time word problems.
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Combinatorial group theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algorithmic theory of polycyclic-by-finite 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.
• The status of polycyclic group-based cryptography: a survey and open problems
• A nonlinear decomposition attack
• Title not available (Why is that?)
• The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
• Title not available (Why is that?)
• Automorphisms of groups
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms
• Infinite groups
• Cryptographic protocols based on inner product spaces and group theory with a special focus on the use of Nielsen transformations
• Topics in infinite group theory. Nielsen methods, covering spaces, and hyperbolic groups

Cited In (20)

• Two general schemes of algebraic cryptography
• Progress in Cryptology - INDOCRYPT 2004
• Title not available (Why is that?)
• Cryptanalysis of the permutation based algorithm SpoC
• A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
• Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
• Cryptanalysis of McEliece’s Public-Key Cryptosystem
• Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
• Cryptanalysis of a computer cryptography scheme based on a filter bank
• Analysis of secret sharing schemes based on Nielsen transformations
• Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
• Title not available (Why is that?)
• Cryptanalysis of a public key cryptosystem based on boolean permutations
• Cryptanalysis on a finite automaton public key cryptosystem
• Cryptanalysis of General Lu-Lee Type Systems
• Algebraic and quantum attacks on two digital signature schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
• Cryptanalysis of Rational Multivariate Public Key Cryptosystems

This page was built for publication: Cryptanalysis of a combinatorial public key cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676249)