A first Catalgorithm?

• Autorzy: Geneste J.-F.

Identyfikatory

DOI

10.24425/119368

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

non commutative rings; zero-knowledge proofs; finite type module

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2018
• Tom: Vol. 64, No. 2
• Strony: 185--188
• Opis fizyczny: Bibliogr. 5 poz.

Twórcy

autor

Geneste J.-F.

• Skolkovo Institute of technology, Moscow, Russia

Bibliografia

• [1] J.J. Quisquater, "Personal communication".
• [2] T. Y. Lam, "Lectures on modules and rings", s.1, Springer, 1999.
• [3] J.F. Geneste, "Séminaire GRECC ENS", 2002.
• [4] "Noncommutative algebra", s.1, Springer, 1993.
• [5] U. Feige, A. Fiat, et A. Shamir, "Zero-knowledge proofs of indentity", Journal of Cryptology, pp77-94.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).