An algebraic method for public-key cryptography

From MaRDI portal
Publication:1574733

DOI10.4310/MRL.1999.v6.n3.a3zbMath0944.94012OpenAlexW1976904648MaRDI QIDQ1574733

Michael Anshel, Dorian Goldfeld, Iris Lee Anshel

Publication date: 13 August 2000

Published in: Mathematical Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/mrl.1999.v6.n3.a3




Related Items (86)

Public key authentication scheme over quaternionsAUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHMEfficient Authentication Scheme Based on the Twisted Near-Ring Root Extraction ProblemReducing the Key Size of Rainbow Using Non-commutative RingsA PTIME solution to the restricted conjugacy problem in generalized Heisenberg groupsGroup ring based public key cryptosystemsComputation of centralizers in braid groups and Garside groups.New public key cryptosystems from combinatorial group theoryBook review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1A parallel evolutionary approach to solving systems of equations in polycyclic groupsAuthenticated commutator key agreement protocolThe status of polycyclic group-based cryptography: a survey and open problemsA nonlinear decomposition attackPublic key protocols over the ring \(E_{p}^{(m)}\)Discrete logarithms for finite groupsKey agreement based on automaton groupsAlgebraic generalization of Diffie-Hellman key exchangeOn Eulerian semigroups of multivariate transformations and their cryptographic applicationsAlgebraic cryptanalysis and new security enhancementsNormal forms of random braids.THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLESA construction of encryption protocols over some semidirect productsGeneric-case complexity, decision problems in group theory, and random walks.On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r)\)] ⋮ On one-way ring homomorphismsMonoidal categories, representation gap and cryptographyConjugacy problem for braid groups and Garside groups.Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$Rewriting system of certain semigroups with three generatorsOn new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groupsOblivious transfer using non-abelian groupsNon-Abelian key agreement protocolsComplexity of the generalized conjugacy problemOn the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\).Affine braid groups: a better platform than braid groups for cryptology?A linear time matrix key agreement protocol over small finite fieldsGröbner basis cryptosystemsCryptosystems using linear groupsCombinatorial group theory and public key cryptographyRepresentation attacks on the Braid Diffie-Hellman public key encryptionConjugacy search in braid groups. From a braid-based cryptogrphy point of viewThe conjugacy search problem in public key cryptography: unnecessary and insufficientShort expressions of permutations as products and cryptanalysis of the algebraic eraserNon-associative public-key cryptographyNon-associative key establishment protocols and their implementationGeometry of the conjugacy problem in lamplighter groupsCategorical interpretations of some key agreement protocolsGENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPSCONJUGACY OF FINITE SUBSETS IN HYPERBOLIC GROUPSOn the conjugacy search problem and left conjugacy closed loopsThe Diffie-Hellman key exchange protocol and non-Abelian nilpotent groupsKey exchange protocols over noncommutative rings. The case ofOn the algebraic structure of \(E_p^{(m)}\) and applications to cryptographyConjugacy in Garside groups. I: Cyclings, powers and rigidity.Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid GroupsEntity authentication schemes using braid word reductionUnnamed ItemExponentially generic subsets of groupsIronwood meta key agreement and authentication protocolSymmetric and asymmetric cryptographic key exchange protocols in the octonion algebraAttack on Kayawood protocol: uncloaking private keysProperties of certain semigroups and their potential as platforms for cryptosystemsOn the cycling operation in braid groups.Efficient solutions to the braid isotopy problem.К анализу некоторых систем открытого распределения ключей, основанных на неабелевых группахPolynomial-time solutions of computational problems in noncommutative-algebraic cryptographyTransitive Signatures from Braid GroupsTHE CONJUGACY PROBLEM AND RELATED PROBLEMS IN LATTICE-ORDERED GROUPSTowards generating secure keys for braid cryptographyAlgebraic cryptography: new constructions and their security against provable breakSome applications of arithmetic groups in cryptographyAn improved version of the AAG cryptographic protocolCryptanalysis of the Shpilrain-Ushakov protocol for Thompson's groupEvolution of group-theoretic cryptology attacks using hyper-heuristicsAn improvement of the Diffie-Hellman noncommutative protocolA Security Analysis of Uniformly-Layered RainbowUnnamed ItemUnnamed ItemConjugacy systems based on nonabelian factorization problems and their applications in cryptographySignature scheme using the root extraction problem on quaternionsA new approach to the conjugacy problem in Garside groups.Public-key cryptography and invariant theoryA novel public-key encryption scheme based on Bass cyclic units in integral group ringsNew approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groupsA family of polycyclic groups over which the uniform conjugacy problem is NP-completeProbabilistic solutions of equations in the braid group.




This page was built for publication: An algebraic method for public-key cryptography