Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
From MaRDI portal
Publication:2516526
DOI10.1007/s00145-013-9170-9zbMath1356.94086arXiv1210.8114OpenAlexW2073001410MaRDI QIDQ2516526
Publication date: 3 August 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8114
algebraic cryptanalysislinear cryptanalysisSchwartz-Zippel lemmabraid-based cryptographybraid Diffie-Hellman key exchangebraid infinimum reductioncentralizer key exchangecommutator key exchangegroup theory-based cryptographyinvertibility lemmalinear centralizer methodnoncommutative-algebraic cryptography
Related Items (16)
The status of polycyclic group-based cryptography: a survey and open problems ⋮ A nonlinear decomposition attack ⋮ Cryptanalysis of a combinatorial public key cryptosystem ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ On Eulerian semigroups of multivariate transformations and their cryptographic applications ⋮ Algebraic cryptanalysis and new security enhancements ⋮ Oblivious transfer using non-abelian groups ⋮ Non-associative public-key cryptography ⋮ A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function ⋮ Attack on Kayawood protocol: uncloaking private keys ⋮ An improved version of the AAG cryptographic protocol ⋮ Cryptanalysis of schemes based on pseudoinverse matrix ⋮ An improvement of the Diffie-Hellman noncommutative protocol ⋮ Two general schemes of algebraic cryptography ⋮ A Practical Cryptanalysis of the Algebraic Eraser ⋮ Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic solutions of equations in the braid group.
- Towards generating secure keys for braid cryptography
- An algebraic method for public-key cryptography
- Representation attacks on the Braid Diffie-Hellman public key encryption
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
- A weak key test for braid based cryptography.
- A new approach to the conjugacy problem in Garside groups.
- A FAMILY OF PSEUDO-ANOSOV BRAIDS WITH LARGE CONJUGACY INVARIANT SETS
- Non-associative public-key cryptography
- Cryptanalysis of Stickel’s Key Exchange Scheme
- Random subgroups and analysis of the length-based and quotient attacks
- Thompson’s Group and Public Key Cryptography
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- Polynomial-time theory of matrix groups
- Advances in Cryptology - CRYPTO 2003
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- Braid Group Cryptography
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
- Braid groups are linear
- Public Key Cryptography - PKC 2006
- Braid groups are linear
This page was built for publication: Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography