DeepAI AI Chat
Log In Sign Up

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

10/06/2018
by   Karan Khathuria, et al.
Universität Zürich
University of Oxford
0

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

page 1

page 2

page 3

page 4

08/24/2019

Circle Graph Isomorphism in Almost Linear Time

Circle graphs are intersection graphs of chords of a circle. In this pap...
05/17/2021

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

It was recently demonstrated that the Matrix Action Key Exchange (MAKE) ...
09/11/2022

Subquadratic Kronecker Regression with Applications to Tensor Decomposition

Kronecker regression is a highly-structured least squares problem min_𝐱‖...
05/07/2021

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

Whilst lattice-based cryptosystems are believed to be resistant to quant...
09/06/2021

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

For the high dimensional data representation, nonnegative tensor ring (N...
11/18/2019

Can 100 Machines Agree?

Agreement protocols have been typically deployed at small scale, e.g., u...