I I need to implement Blakley's Secret Sharing Scheme. I have read below mentioned two research papers but still unable to understand how to implement it.
1. Safeguarding cryptographic keys
2. Two Matrices for Blakley’s Secret Sharing Scheme
- Safeguarding cryptographic keys
- Two Matrices for Blakley’s Secret Sharing Scheme
The The following is the steps I have been able to understand.
a. We chose positive integers "z", "a" and "b".
b. We chose a large "p"
c. A (a+b+2) x (b+2) matrix M is created satisfying the following conditions-
- We chose positive integers $z$, $a$ and $b$.
- We chose a large $p$
- A $(a+b+2)\times(b+2)$ matrix $M$ is created satisfying the following conditions:
- Random entry in each row is set to 1$1$.
- Another random entry in 1stfirst row is set to k$k$, chosen from F (field modulo p)$\mathbb F_p$.
- All other entries are filled with random values from F$\mathbb F_p$.
After After this some equation need to be formed and then solved for share.
I
I am unable to understand how shares are calculated and how can they be verified. Kindly help me understand the remaining process.
Thank you in advance.
