An improved secret sharing algorithm

Abstract

Assuming the desire of a 9-man Election Tribunal Judges is to protect their judgment from public knowledge before judgment is delivered. They decided to lock up their judgment in a cabinet. They agree that any 5 judges can open the cabinet to retrieve the document, but not less than 5 can do so. To achieve this, they will need 126 5 9  c padlocks to secure the cabinet. This is prohibitive and impracticable in real life. A secret sharing algorithm will achieve the judges' desire without having to purchase 126 padlocks to secure the cabinet.