Two general schemes of algebraic cryptography
From MaRDI portal
Publication:2317165
DOI10.1515/gcc-2018-0009zbMath1491.94064OpenAlexW2902408229MaRDI QIDQ2317165
Publication date: 8 August 2019
Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/gcc-2018-0009
Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
A nonlinear decomposition attack ⋮ On Eulerian semigroups of multivariate transformations and their cryptographic applications ⋮ Algebraic cryptanalysis and new security enhancements ⋮ Monoidal categories, representation gap and cryptography ⋮ An improved version of the AAG cryptographic protocol ⋮ An improvement of the Diffie-Hellman noncommutative protocol ⋮ Two general schemes of algebraic cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The status of polycyclic group-based cryptography: a survey and open problems
- A nonlinear decomposition attack
- Group-based cryptography
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
- Cryptanalysis via algebraic spans
- Random nilpotent groups, polycyclic presentations, and Diophantine problems
- Cryptanalysis of a combinatorial public key cryptosystem
- Length-based attacks in polycyclic groups
- Two general schemes of algebraic cryptography
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- A linear decomposition attack
- Public key cryptography based on semigroup actions
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Cryptosystems in automorphism groups of group rings of Abelian groups.
- Faithful representations of p-groups at characteristic p. I
- Equations over groups
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
- Group ring cryptography
- New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems
- Search and witness problems in group theory
- Cryptanalysis of three matrix-based key establishment protocols
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
- Cryptanalysis of Stickel’s Key Exchange Scheme
- Random subgroups and analysis of the length-based and quotient attacks
- Построение алгебраической криптосистемы над квазигрупповым кольцом
- Logspace and compressed-word computations in nilpotent groups
- TC^0 circuits for algorithmic problems in nilpotent groups
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS
- A Linear Algebra Attack to Group-Ring-Based Key Exchange Protocols
- Advances in Cryptology - CRYPTO 2003
- 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
