Pages that link to "Item:Q2516526"
From MaRDI portal
The following pages link to Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography (Q2516526):
Displaying 16 items.
- The status of polycyclic group-based cryptography: a survey and open problems (Q338844) (← links)
- A nonlinear decomposition attack (Q338847) (← links)
- Cryptanalysis of a combinatorial public key cryptosystem (Q1676249) (← links)
- Attack on Kayawood protocol: uncloaking private keys (Q2033519) (← links)
- An improvement of the Diffie-Hellman noncommutative protocol (Q2068386) (← links)
- Algebraic cryptanalysis and new security enhancements (Q2188748) (← links)
- An improved version of the AAG cryptographic protocol (Q2304870) (← links)
- Two general schemes of algebraic cryptography (Q2317165) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Cryptanalysis of schemes based on pseudoinverse matrix (Q2825277) (← links)
- A Practical Cryptanalysis of the Algebraic Eraser (Q2835587) (← links)
- Non-associative public-key cryptography (Q2975249) (← links)
- A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function (Q2980865) (← links)
- Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family (Q5859674) (← links)
- On Eulerian semigroups of multivariate transformations and their cryptographic applications (Q6055054) (← links)
- The group factorization problem in finite groups of Lie type (Q6551706) (← links)
