SECRET SHARING SCHEME VIA SKEW POLYNOMIAL
This research explores advanced techniques in cryptographic security, focusing on secret sharing schemes based on non-commutative algebraic structures. A secret sharing scheme divides a secret into multiple parts, reconstructable from a sufficient number of pieces, exemplified by Shamir’s secret...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/81916 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | This research explores advanced techniques in cryptographic security, focusing on secret
sharing schemes based on non-commutative algebraic structures. A secret sharing
scheme divides a secret into multiple parts, reconstructable from a sufficient number of
pieces, exemplified by Shamir’s secret sharing scheme. The method described divides
data S into r pieces, reconstructable from any r pieces, while r ????1 pieces reveal no
information, enhancing key management security even under severe breaches.
Additionally, cryptosystems utilizing skew polynomials over finite fields have gained
attention for their complexity and potential security benefits. Skew polynomials
generalize polynomials over commutative rings, promising a more secure platform. Introduced
by Ore in 1933 and further studied by Lam and Leroy, skew polynomial rings
leverage complex evaluation and interpolation processes to enhance security. This approach
can be viewed as a generalization of Shamir’s secret sharing scheme, offering a
robust and secure cryptographic framework. |
|---|