Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Thompson’s Group and Public Key Cryptography - MaRDI portal

Thompson’s Group and Public Key Cryptography

From MaRDI portal
Publication:3593139

DOI10.1007/11496137_11zbMath1126.68416arXivmath/0505487OpenAlexW1545445951MaRDI QIDQ3593139

Vladimir Shpilrain, Alexander Ushakov

Publication date: 24 September 2007

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505487




Related Items (24)

Thompson's group \(F\) is 1-counter graph automatic.A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groupsAuthenticated commutator key agreement protocolQuantum algorithms for typical hard problems: a perspective of cryptanalysisA construction of encryption protocols over some semidirect productsFull quantum equivalence of group action DLog and CDH, and moreRewriting system of certain semigroups with three generatorsThe Generation Problem in Thompson Group 𝐹Oblivious transfer using non-abelian groupsAffine braid groups: a better platform than braid groups for cryptology?On subgroups of R. Thompson’s group $F$Generic complexity of finitely presented monoids and semigroupsCoherence and strictification for self-similarityCryptanalysis of a key exchange protocol based on the ring \(E_p^{(m)}\)Length-based cryptanalysis: the case of Thompson's groupProperties of certain semigroups and their potential as platforms for cryptosystemsPolynomial-time solutions of computational problems in noncommutative-algebraic cryptographyWhy you cannot even hope to use Ore algebras in cryptographyDetermining solubility for finitely generated groups of PL homeomorphismsCryptanalysis of the Shpilrain-Ushakov protocol for Thompson's groupKnapsack problems in groupsWhy you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failuresUnnamed ItemConjugacy systems based on nonabelian factorization problems and their applications in cryptography


Uses Software



This page was built for publication: Thompson’s Group and Public Key Cryptography