Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography (Q2516526)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography |
scientific article |
Statements
Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography (English)
0 references
3 August 2015
0 references
noncommutative-algebraic cryptography
0 references
group theory-based cryptography
0 references
braid-based cryptography
0 references
commutator key exchange
0 references
centralizer key exchange
0 references
braid Diffie-Hellman key exchange
0 references
linear cryptanalysis
0 references
invertibility lemma
0 references
Schwartz-Zippel lemma
0 references
linear centralizer method
0 references
braid infinimum reduction
0 references
algebraic cryptanalysis
0 references
0 references
