Algebraic generalization of Diffie-Hellman key exchange
From MaRDI portal
Publication:2413287
DOI10.1515/jmc-2017-0015zbMath1391.94787OpenAlexW2768120416MaRDI QIDQ2413287
Publication date: 10 April 2018
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2017-0015
Cryptography (94A60) Applications of universal algebra in computer science (08A70) Finitary algebras (08A62)
Related Items (max. 100)
Pseudo-free families and cryptographic primitives ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ A key agreement protocol based on group actions ⋮ Pseudo-free families of computational universal algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An observation on associative one-way functions in complexity theory
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- On the conjugacy search problem and left conjugacy closed loops
- Discrete logarithms in \(\mathrm{GF}(p)\)
- A key-exchange system based on imaginary quadratic fields
- Idempotent medial \(n\)-groupoids defined on fields
- Hyperelliptic cryptosystems
- A classifying invariant of knots, the knot quandle
- Efficient signature generation by smart cards
- An algebraic method for public-key cryptography
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- An efficient entire chaos-based scheme for deniable authentication
- Automated deduction in equational logic and cubic curves
- Secure integration of asymmetric and symmetric encryption schemes
- Algebraic generalization of Diffie-Hellman key exchange
- Combinatorial group theory and public key cryptography
- Public key cryptography based on semigroup actions
- Characterization of security notions for probabilistic private-key encryption
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Multilinear Maps from Obfuscation
- A Decade of Lattice Cryptography
- Secure communications over insecure channels
- Cryptanalysis of GGH Map
- On beating the hybrid argument
- LEFT CONJUGACY CLOSED LEFT QUASIGROUPS WITH PAIRWISE DISTINCT LEFT TRANSLATIONS
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
- Cryptanalysis of GGH15 Multilinear Maps
- Practical Multilinear Maps over the Integers
- Public Key Exchange Using Semidirect Product of (Semi)Groups
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
- Lattice Cryptography for the Internet
- Cryptanalysis of the Multilinear Map over the Integers
- Authenticated Key Exchange from Ideal Lattices
- Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World
- New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Random-Self-Reducibility of Complete Sets
- Cryptanalysis of the Dickson-Scheme
- Elliptic Curve Cryptosystems
- New directions in cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Nonmalleable Cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Permutation Polynomials in RSA-Cryptosystems
- Graph-Induced Multilinear Maps from Lattices
- On varieties of left distributive left idempotent groupoids
- Quasigroups and cubic curves
- Tropical Cryptography
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Introduction to Lie Algebras and Representation Theory
- Symmetric and Self-Distributive Systems
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Algebraic generalization of Diffie-Hellman key exchange
