On Mignotte Secret Sharing Schemes over Gaussian Integers

Autor:	Munuera-Merayo, Diego
Rok vydání:	2021
Předmět:	Computer Science - Cryptography and Security Computer Science - Information Theory 94A62 13F07
Druh dokumentu:	Working Paper
Popis:	Secret Sharing Schemes (SSS) are methods for distributing a secret among a set of participants. One of the first Secret Sharing Schemes was proposed by M. Mignotte, based on the Chinese remainder theorem over the ring of integers. In this article we extend the Mignotte's scheme to the ring of Gaussian Integers and study some of its properties. While doing this we aim to solve a gap in a previous construction of such extension. In addition we show that any access structure can be made through a SSS over $ \mathbb{Z}[i]$. Comment: 12 pages. There is one figure in page 6. To be submitted to the Journal of Algebra Combinatorics Discrete Structures and Applications
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2104.06361 Zobrazit plný text záznamu View this record from Arxiv