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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
