Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
138 views

Can we make Discrete Log (significant) more secure by introducing non-commutative algebra (e.g. matrices, hypercomplex numbers, )

$$g^a = c \bmod{N} \text{ }\rightarrow \text{ }G_{i_1}G_{i_2}G_{i_3}...G_{i_n} = C \bmod N $$ At the Discrete Log problem we try to find the exponent ($a$) of a generator ($g$) over a finite filed....
J. Doe's user avatar
  • 453
0 votes
0 answers
32 views

Checking whether a particular group has an efficient, faithful representation as a matrix group

There are cryptographic protocols being developed for non-abelian groups. For some protocols it is necessary to know whether the group has an efficient representation as a matrix group (say, a matrix ...
Buddhini Angelika's user avatar