While the naive peer to peer primitive is easier to understand and analyse, the second system gives the flexibility for the implementor to decide the trade off between the amount of data (number of equations) vs. the redundancy in the system (if some equations are not delivered the user can still compute a subset of secrets).
= X. Conclusion Next Steps = <span style="font-size:200%">IT</span>n this his document, we presented is the final first public draft of the ''(n)sec''protocol. We hope by receiving public comment on this draft we are able genuinely hoping to improve the design. We receive a lot of feedback and review on this work and have referenced chosen the adversarial models which the protocol is supposed wiki format to resistsupport [[Talk:Nsec|Discussion]]. Meanwhile we are working on an implementation of ''(n)sec''. We will publish a sequel document which high light Ongoing tasks for the implementation details as well as proof team include mathematical proofs of resistance to the adversarial model presented hereherein as well as technical implementation details. This is currently scheduled for the end of December, 2014. The [https://github.com/equalitie/np1sec np1sec] software library will be initially implemented in [https://github.com/cryptocat/cryptocat/ Cryptocat] and (with your help) further developed to suit a variety of use-cases in the near future.
= XI. References =