70  * that all our shares and secret lie in Fp, and hence are < p,
102 	/* Export our idx in big endian representation on two bytes */  in _sss_derive_seed()
111 	/* Now import our reduced value in Fp as the result of the derivation */  in _sss_derive_seed()
149 	/* Import our prime number and create the Fp context */  in _sss_raw_generate()
153 	/* Generate a secret seed of the size of the secret that will be our base to  in _sss_raw_generate()
157 	/* NOTE: although we could generate all our a[i] coefficients using our randomness  in _sss_raw_generate()
159 	 * the storage space as our share generation algorithm needs to parse these a[i] multiple  in _sss_raw_generate()
163 	 * Our secret seed is SSS_SECRET_SIZE long, so on the security side there should be no  in _sss_raw_generate()
178 		 * XXX: NOTE: the user shared secret MUST be in Fp! Since our prime is < (2**256 - 1),  in _sss_raw_generate()
184 		/* Generate the secret from our seed */  in _sss_raw_generate()
206 	 * we begin our x.  in _sss_raw_generate()
231 			/* Compute our a[j] coefficient */  in _sss_raw_generate()
238 			 * to be able to use our more performant redcified versions of Fp multiplication.  in _sss_raw_generate()
242 			 * differ depending on this size. However, this is not really an issue per se for our SSS  in _sss_raw_generate()
243 			 * as we are in our generation primitive and the a[j] coefficients are expected to be  in _sss_raw_generate()
263 	/* We can throw away our secret seed now that the shares have  in _sss_raw_generate()
285 …*       the idea is to have using Lagrage formulas the value f(val) where f is our polynomial. Of …
307 	/* Import our prime number and create the Fp context */  in _sss_raw_lagrange()
311 	/* Recombine our shared secrets */  in _sss_raw_lagrange()
321 		 * f(0) (where f(.) is our polynomial) is the formula for getting the  in _sss_raw_lagrange()
332 	/* Perform the computation of r^-1 to optimize our multiplications using Montgomery  in _sss_raw_lagrange()
367 					 * f(0) (where f(.) is our polynomial) is the formula for getting the  in _sss_raw_lagrange()
386 	/* We should have our secret in y */  in _sss_raw_lagrange()
451 		 * our structures are packed.  in sss_generate()
495 		 * our structures are packed.  in sss_combine()
500 		/* Check that all our shares have the same session ID, return an error otherwise */  in sss_combine()
556 	/* Check the authenticity of our shares */  in sss_regenerate()
563 		 * our structures are packed.  in sss_regenerate()
568 		/* Check that all our shares have the same session ID, return an error otherwise */  in sss_regenerate()
579 		/* NOTE: we 'abuse' cast here for secret to (const u8*), but this should be OK since our  in sss_regenerate()
593 	/* Our secret regeneration consists of determining the maximum index, and  in sss_regenerate()
614 …* our shares[i].raw_share.share is a SSS_SECRET_SIZE as the sss_secret.secret type encapsulates an…  in sss_regenerate()
627 		/* Copy our session ID */  in sss_regenerate()