Random subgroups and analysis of the length-based and quotient attacks
From MaRDI portal
Publication:3516765
DOI10.1515/JMC.2008.003zbMath1195.94067arXiv0707.1501OpenAlexW2963909615MaRDI QIDQ3516765
Alexander Ushakov, Alexei G. Myasnikov
Publication date: 11 August 2008
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.1501
length-based attackbraid group cryptographycommutator key-exchangequotient attackrandom subgroup of a braid group
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Braid groups; Artin groups (20F36) Asymptotic properties of groups (20F69) Probabilistic methods in group theory (20P05)
Related Items
A parallel evolutionary approach to solving systems of equations in polycyclic groups, Authenticated commutator key agreement protocol, The status of polycyclic group-based cryptography: a survey and open problems, A nonlinear decomposition attack, The conjugacy problem in the Grigorchuk group is polynomial time decidable., Exponentially generic subsets of groups, Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography, Homomorphism Reconfiguration via Homotopy, On asymptotic densities and generic properties in finitely generated groups, Random generation of Thompson group \(F\), Two general schemes of algebraic cryptography, Linear time algorithm for the conjugacy problem in the first Grigorchuk group, Random Subgroups of Acylindrically Hyperbolic Groups and Hyperbolic Embeddings, SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
