A first Catalgorithm ?

Jean-François Geneste


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.

Full Text:



J.-J. Quisquater, Interviewee, Personal communication. [Interview].

T. Y. Lam, Lectures on modules and rings, Springer, 1999.

J.-F. Geneste, Interviewee, Séminaire GRECC ENS. [Interview]. 2002.

Noncommutative algebra, Springer, 1993.

U. Feige, A. Fiat et A. Shamir, «Zero-knowledge proofs of indentity,» Journal of Cryptology, pp. pp77-94.


  • There are currently no refbacks.

International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences

eISSN: 2300-1933