Generalized Mignotte's Sequences Over Polynomial Rings

DOI10.1016/j.entcs.2006.12.044zbMath1277.94052OpenAlexW2065460963MaRDI QIDQ2866726

Tatyana V. Galibus, Genadii Matveev

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.12.044

zbMATH Keywords

thresholdChinese remainder theoremEuclidean ringaccess structuresharesco-prime polynomialsMignotte secret sharingmodular secret sharing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ Unnamed Item ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ Finite Fields, Gröbner Bases and Modular Secret Sharing ⋮ Unnamed Item

Cites Work

• How to share a secret
• Chinese remaindering with errors
• How to Share a Secret
• A modular approach to key safeguarding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized Mignotte's Sequences Over Polynomial Rings