Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cryptanalysis of some protocols using matrices over group rings

Published 16 Mar 2015 in cs.CR | (1503.04779v1)

Abstract: We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.

Citations (13)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Mohammad Eftekhari 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up