Abstract
We propose building a new PKC in a ring structure, the classification of rings being an open problem. The difficulty of
the scheme is based on retrieving the eigenvalues of endomorphism on a finite type module over a non-commutative ring. It is resistant
to a chosen cipher text attack. Working in the fraction ring of a non-commutative ring makes our scheme a zero-knowledge proof
of knowledge, result indistinguishable, in the Naor-Yung model. Finally, a dramatic improvement in security is obtained through
the drawing with uniform probability of the working ring at high frequency.
Go to article