A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing
From MaRDI portal
Recommendations
Cites work
- A modular approach to key safeguarding
- An explication of secret sharing schemes
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Generalized Mignotte's sequences over polynomial rings
- How to share a secret
- How to share a secret
- scientific article; zbMATH DE number 3923971 (Why is no real title available?)
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- Improvements in geometry-based secret image sharing approach with steganography
- The General Chinese Remainder Theorem
Cited in
(3)
This page was built for publication: A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212443)