1- If the order of a (mod P) is 3, prove that the order of a+1 is 6.
2- Explain why the "simplifiled knapsack" code is not secure.