Algebraic cryptanalysis and new security enhancements
From MaRDI portal
Publication:2188748
DOI10.2140/moscow.2020.9.123OpenAlexW3025299025MaRDI QIDQ2188748
Publication date: 11 June 2020
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/moscow.2020.9.123
Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70)
Cites Work
- Unnamed Item
- Unnamed Item
- A nonlinear decomposition attack
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- An algebraic method for public-key cryptography
- Cryptanalysis via algebraic spans
- An improved version of the AAG cryptographic protocol
- Two general schemes of algebraic cryptography
- A linear decomposition attack
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Cryptanalysis of a Matrix-based MOR System
- A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups II
- A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- The MOR Cryptosystem And Extra-Specialp-Groups
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
- Braid groups are linear
- Braid groups are linear