Cryptanalysis of the DHDP and EGDP protocols over E_p^(m)

10/06/2018

∙

by Karan Khathuria, et al.

∙

Universität Zürich

∙

University of Oxford

∙

In this paper we break the protocol based on the Diffie-Hellman Decomposition problem and ElGamal Decomposition problem over the matrix ring E_p^(m). Our attack terminates in a provable running time of O(m^10).

READ FULL TEXT

Cryptanalysis of the DHDP and EGDP protocols over E_p^(m)

Circle Graph Isomorphism in Almost Linear Time

Cryptanalysis of Semidirect Product Key Exchange Using Matrices Over Non-Commutative Rings

Subquadratic Kronecker Regression with Applications to Tensor Decomposition

Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group

Fast Hypergraph Regularized Nonnegative Tensor Ring Factorization Based on Low-Rank Approximation

PQC: Extended Triple Decomposition Problem (XTDP) Applied To GL(d, Fp)-An Evolved Framework For Canonical Non-Commutative Cryptography

Can 100 Machines Agree?

Cryptanalysis of the DHDP and EGDP protocols over E_p^(m)

Related Research

Circle Graph Isomorphism in Almost Linear Time

Cryptanalysis of Semidirect Product Key Exchange Using Matrices Over Non-Commutative Rings

Subquadratic Kronecker Regression with Applications to Tensor Decomposition

Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group

Fast Hypergraph Regularized Nonnegative Tensor Ring Factorization Based on Low-Rank Approximation

PQC: Extended Triple Decomposition Problem (XTDP) Applied To GL(d, Fp)-An Evolved Framework For Canonical Non-Commutative Cryptography

Can 100 Machines Agree?